Node-weighted prize-collecting survivable network design problems

[1]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[2]  Andrew V. Goldberg,et al.  Improved approximation algorithms for network design problems , 1994, SODA '94.

[3]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[4]  David P. Williamson,et al.  A primal-dual approximation algorithm for generalized steiner network problems , 1995, Comb..

[5]  David P. Williamson,et al.  A primal-dual schema based approximation algorithm for the element connectivity problem , 2002, SODA '99.

[6]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, Inf. Comput..

[7]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[8]  Kamal Jain.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[9]  Santosh S. Vempala,et al.  Network Design via Iterative Rounding of Setpair Relaxations , 2022 .

[10]  Mohammad Taghi Hajiaghayi,et al.  The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema , 2006, SODA '06.

[11]  David P. Williamson,et al.  Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..

[12]  Fabián A. Chudak,et al.  Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization , 2007, SODA '07.

[13]  Chaitanya Swamy,et al.  Approximation algorithms for prize collecting forest problems with submodular penalty functions , 2007, SODA '07.

[14]  David P. Williamson,et al.  Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements , 2008, WAOA.

[15]  Shai Gutner.  Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems , 2008, COCOA.

[16]  Philip N. Klein,et al.  Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs , 2009, ICALP.

[17]  Sanjeev Khanna,et al.  An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design , 2012, Theory Comput..

[18]  Mohammad Taghi Hajiaghayi,et al.  Prize-Collecting Steiner Networks via Iterative Rounding , 2010, LATIN.

[19]  Zeev Nutov.  Approximating Steiner Networks with Node-Weights , 2010, SIAM J. Comput..

[20]  Mohammad Taghi Hajiaghayi,et al.  Prize-Collecting Steiner Network Problems , 2010, IPCO.

[21]  Jochen Könemann,et al.  Approximation algorithms for network design: A survey , 2011 .

[22]  Chandra Chekuri,et al.  Node-weighted Network Design in Planar and Minor-closed Families of Graphs , 2012, ICALP.

[23]  Zeev Nutov.  Approximating minimum-cost connectivity problems via uncrossable bifamilies , 2012, TALG.

[24]  Chandra Chekuri,et al.  Prize-Collecting Survivable Network Design in Node-Weighted Graphs , 2012, APPROX-RANDOM.