On the complexity of multi-dimensional interval routing schemes

Publisher： Elsevier

ISSN： 0304-3975

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

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

Multidimensional interval routing schemes

By Flammini M. Gambosi G. Nanni U. Tan R.B.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 115-133

Elsevier

Access to resources Recommend Favorite

Static and dynamic low-congested interval routing schemes

By Cicerone S. Di Stefano G. Flammini M.

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 315-354

Elsevier

Access to resources Recommend Favorite

Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm

By Tóth Boglárka Casado Leocadio

Journal of Global Optimization, Vol. 38, Iss. 2, 2007-06 ,pp. : 215-236

Springer Publishing Company

Access to resources Recommend Favorite

New bounds for multi-label interval routing

By Tse S.S.H. Lau F.C.M.

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 61-77

Elsevier

Access to resources Recommend Favorite

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

By Eilam T. Moran S. Zaks S.

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

Elsevier

Access to resources Recommend Favorite