Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum spanning tree problem (namely laminar crossing spanning tree), and (2) by incorporating 'degree bounds' in other combinatorial optimization problems such as matroid intersection and lattice polyhedra. We give new or improved approximation algorithms, hardness results, and integrality gaps for these problems. © 2010 Springer-Verlag.
CITATION STYLE
Bansal, N., Khandekar, R., Könemann, J., Nagarajan, V., & Peis, B. (2010). On generalizations of network design problems with degree bounds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6080 LNCS, pp. 110–123). https://doi.org/10.1007/978-3-642-13036-6_9
Mendeley helps you to discover research relevant for your work.