On Generalizations of Network Design Problems with Degree Bounds

Details On Generalizations of Network Design Problems with Degree Bounds On Generalizations of Network Design Problems with Degree Bounds

2010-03-15

arxiv.org/abs/1003.2977v2

Computer Science

Data Structures and Algorithms

v2, 24 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Generalizations of Network Design Problems with Degree Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Generalizations of Network Design Problems with Degree Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Generalizations of Network Design Problems with Degree Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214963