Download now Free registration required
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. This paper extends the scope of the iterative relaxation method in two directions: by handling more complex degree constraints in the minimum spanning tree problem namely laminar crossing spanning tree, and by incorporating 'Degree Bounds' in other combinatorial optimization problems such as matroid intersection and lattice polyhedra.
- Format: PDF
- Size: 293.9 KB