A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
From MaRDI portal
Recommendations
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
Cited in
(12)- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- Approximation schemes for degree-restricted MST and red-blue separation problems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Network Design with Weighted Degree Constraints
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- Fast combinatorial algorithms for efficient sortation
- Fast combinatorial algorithms for efficient sortation
- Approximating Directed Weighted-Degree Constrained Networks
- Spanning trees with minimum weighted degrees
- Approximating directed weighted-degree constrained networks
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
This page was built for publication: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613760)
