Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1122.90398OpenAlexW2649657569MaRDI QIDQ5479356

No author found.

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538462

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Spanning trees with minimum weighted degrees ⋮ What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs ⋮ A distributed approximation algorithm for the minimum degree minimum weight spanning trees ⋮ An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem ⋮ Budgeted matching and budgeted matroid intersection via the gasoline puzzle ⋮ Network Design with Weighted Degree Constraints ⋮ Degree-bounded minimum spanning trees ⋮ A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques