The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing

Tamar Eilam, Shlomo Moran, Shmuel Zaks. The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. In Danny Krizanc, Peter Widmayer, editors, SIROCCO 97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997. pages 99-111, Carleton Scientific, 1997.

@inproceedings{EilamMZ97,
  title = {The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing},
  author = {Tamar Eilam and Shlomo Moran and Shmuel Zaks},
  year = {1997},
  tags = {routing},
  researchr = {https://researchr.org/publication/EilamMZ97},
  cites = {0},
  citedby = {0},
  pages = {99-111},
  booktitle = {SIROCCO 97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997},
  editor = {Danny Krizanc and Peter Widmayer},
  publisher = {Carleton Scientific},
}