Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
SIAM Journal on Computing
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Two-phase greedy algorithms for some classes of combinatorial linear programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive guarantees for degree bounded directed network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating Directed Weighted-Degree Constrained Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Degree bounded matroids and submodular flows
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A push-relabel algorithm for approximating degree bounded MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
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.