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

Authors:
Guangting Chen;Guoliang Xue
Affiliations:
-;-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 9
Cited 0

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
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

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 fully polynomial time approximation scheme for this NP-complete problem.