A PTAS for weight constrained Steiner trees in series-parallel graphs

Authors:
Guangting Chen;Guoliang Xue
Affiliations:
School of Science and Arts, Hangzhou Institute of Electronic Engineering, Hangzhou, China;Department of Computer Science and Engineering, Arizona State University, P.O. Box 875406, Tempe, AZ
Venue:
Theoretical Computer Science
Year:
2003

Citing 10
Cited 4

Generalized Steiner problem in series-parallel networks

Journal of Algorithms
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
K-pair delay constrained minimum cost routing in undirected networks

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Research: A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

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
Efficient algorithms for the prize collecting Steiner tree problems with interval data

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we study the problem of computing a minimum cost Steiner tree subject to weight constraint in a series-parallel graph where each edge has a nonnegative integer cost and a nonnegative integer weight. We present a strongly polynomial time approximation scheme for this NP-complete problem.