Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules

Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Combinatorica, 19(3):375-401, 1999. [doi]

@article{LeightonMR99,
  title = {Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules},
  author = {Frank Thomson Leighton and Bruce M. Maggs and Andréa W. Richa},
  year = {1999},
  url = {http://link.springer.de/link/service/journals/00493/bibs/9019003/90190375.htm},
  tags = {routing},
  researchr = {https://researchr.org/publication/LeightonMR99},
  cites = {0},
  citedby = {0},
  journal = {Combinatorica},
  volume = {19},
  number = {3},
  pages = {375-401},
}