The complexity of the characterization of networks supporting shortest-path interval routing

Author： Eilam T.   Moran S.   Zaks S.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 85-104

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Solving the Shortest Path Problem with Interval Arcs

By Sengupta Atanu   Pal Tapan  

Fuzzy Optimization and Decision Making, Vol. 5, Iss. 1, 2006-01 ,pp. : 71-89

Springer Publishing Company

Access to resources Recommend Favorite

Interval routing in some planar networks

By Chepoi V.   Rollin A.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1503-1540

Elsevier

Access to resources Recommend Favorite

On the complexity of multi-dimensional interval routing schemes

By Ruzicka P.   Stefankovic D.  

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 255-280

Elsevier

Access to resources Recommend Favorite

Intra-domain traffic engineering with shortest path routing protocols

By Altın Ayşegül  

Annals of Operations Research, Vol. 204, Iss. 1, 2013-04 ,pp. : 65-95

Springer Publishing Company

Access to resources Recommend Favorite

SHORT: shortest hop routing tree for wireless sensor networks

By Yang Yang   Wu Hui-Hai   Chen Hsiao-Hwa  

International Journal of Sensor Networks, Vol. 2, Iss. 5-6, 2007-07 ,pp. : 368-374

Inderscience Publishers

Access to resources Recommend Favorite