### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |

Pages | 230-231 |

Number of pages | 2 |

State | Published - 2001 |

Externally published | Yes |

Event | 2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: Apr 30 2001 → May 1 2001 |

### Other

Other | 2001 Operating Section Proceedings, American Gas Association |
---|---|

Country | United States |

City | Dallas, TX |

Period | 4/30/01 → 5/1/01 |

### Fingerprint

### Keywords

- Algorithms
- Performance
- Reliability
- Theory

### ASJC Scopus subject areas

- Software
- Mathematics(all)

### Cite this

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*(pp. 230-231)

**K-pair delay constrained minimum cost routing in undirected networks.** / Chen, Guangting; Xue, Guoliang.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.*pp. 230-231, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 4/30/01.

}

TY - GEN

T1 - K-pair delay constrained minimum cost routing in undirected networks

AU - Chen, Guangting

AU - Xue, Guoliang

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Algorithms

KW - Performance

KW - Reliability

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=64049088015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=64049088015&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:64049088015

SN - 0898714907

SP - 230

EP - 231

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -