Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 206-217
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Approximation algorithms for network design: A surveySurveys in Operations Research and Management Science, 2011
- An improved LP-based approximation for steiner tree2010
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design2009
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs2009
- Network Design Via Iterative Rounding Of Setpair RelaxationsCombinatorica, 2006
- A primal–dual schema based approximation algorithm for the element connectivity problemJournal of Algorithms, 2002
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica, 2001
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995