K-pair delay constrained minimum cost routing in undirected networks

Guangting Chen, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.

Original languageEnglish (US)
Title of host publicationProceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages230-231
Number of pages2
StatePublished - Dec 1 2001
Externally publishedYes
Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
Duration: Apr 30 2001May 1 2001

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Other

Other2001 Operating Section Proceedings, American Gas Association
CountryUnited States
CityDallas, TX
Period4/30/015/1/01

Keywords

  • Algorithms
  • Performance
  • Reliability
  • Theory

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'K-pair delay constrained minimum cost routing in undirected networks'. Together they form a unique fingerprint.

Cite this