K-pair delay constrained minimum cost routing in undirected networks

Authors:
Guangting Chen;Guoliang Xue
Affiliations:
School of Science and Arts, Hangzhou Inst. of Electronic Engineering, Hangzhou 310037, P.R.China;Computer Science Department, University of Vermont, Burlington, VT
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 5
Cited 6

Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
QoS routing in networks with inaccurate information: theory and algorithms

IEEE/ACM Transactions on Networking (TON)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A PTAS for weight constrained Steiner trees in series-parallel graphs

Theoretical Computer Science
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM Journal on Computing
Cost-Constrained minimum-delay multicasting

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
The subdivision-constrained routing requests problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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 di, is the ith 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.