On Generalizations of Network Design Problems with Degree Bounds
Data Structures and Algorithms
2015-05-18 v2
Abstract
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.
Cite
@article{arxiv.1003.2977,
title = {On Generalizations of Network Design Problems with Degree Bounds},
author = {Nikhil Bansal and Rohit Khandekar and Jochen Konemann and Viswanath Nagarajan and Britta Peis},
journal= {arXiv preprint arXiv:1003.2977},
year = {2015}
}
Comments
v2, 24 pages, 4 figures