Euclidean Prize-Collecting Steiner Forest
نویسندگان
چکیده
منابع مشابه
On Euclidean Prize-collecting Steiner Forest Problems
In this paper, we consider prize-collecting Steiner forest and k-Steiner forest when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we simplify the analysis of the polynomial-time approximation scheme (PTAS) of Borradaile et al. [7, 8] for the Euclidean Steiner forest problem. This is done by proving a new structural property an...
متن کاملPrize-Collecting Steiner Tree and Forest in Planar Graphs
We obtain polynomial-time approximation-preserving reductions (up to a factor of 1+ε) from the prizecollecting Steiner tree and prize-collecting Steiner forest problems in planar graphs to the corresponding problems in graphs of bounded treewidth. We also give an exact algorithm for the prize-collecting Steiner tree problem that runs in polynomial time for graphs of bounded treewidth. This, com...
متن کاملThe Prize Collecting Steiner Tree Problem
This work is motivated by an application in local access network design that can be modeled using the KP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop several modifications to the algorithm which lead to theoretical as well as practical improvements in...
متن کاملPrize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network design problem. We show as an structural result that in each iteration of our algorithm there is an LP variable in a basic feasible solution which is at least one-third-integral resulting a 3-approximation algorithm for...
متن کاملOn the Integrality Gap of the Prize-Collecting Steiner Forest LP
1 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada [email protected] 2 Department of Econometrics and Operations Research, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; and CWI, Amsterdam, The Netherlands [email protected] 3 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada [email protected] 4 Te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9491-8