Fast combinatorial algorithms for efficient sortation
From MaRDI portal
Cites work
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
- Additive Approximation for Bounded Degree Survivable Network Design
- Additive guarantees for degree-bounded directed network design
- Approximating directed weighted-degree constrained networks
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Bounded Degree Group Steiner Tree Problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Faster matroid intersection
- Many birds with one stone
- On a connection between the existence of k-trees and the toughness of a graph
- On approximating degree-bounded network design problems
- Online degree-bounded Steiner network design
- Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
- Scalable timing-aware network design via Lagrangian decomposition
- Survivable network design with degree or order constraints
- Tough graphs and Hamiltonian circuits.
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
This page was built for publication: Fast combinatorial algorithms for efficient sortation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030544)
