Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs

Piotr Berman, Grigory Yaroslavtsev. Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. In Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Volume 7408 of Lecture Notes in Computer Science, pages 50-60, Springer, 2012. [doi]

Abstract

Abstract is missing.