scientific article; zbMATH DE number 7053372
From MaRDI portal
Publication:5743495
zbMath1423.90265arXiv1107.5329MaRDI QIDQ5743495
Publication date: 10 May 2019
Full work available at URL: https://arxiv.org/abs/1107.5329
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Matroid and knapsack center problems ⋮ New approaches to multi-objective optimization ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ Chain-constrained spanning trees ⋮ Refuting a conjecture of goemans on bounded degree spanning trees ⋮ Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems ⋮ \(k\)-trails: recognition, complexity, and approximations ⋮ Approximate multi-matroid intersection via iterative refinement
Cites Work
- Unnamed Item
- Unnamed Item
- On generalizations of network design problems with degree bounds
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- Degree Bounded Matroids and Submodular Flows
- Survivable network design with degree or order constraints
- Approximating minimum bounded degree spanning trees to within one of optimal
- Primal-dual meets local search
- Additive Guarantees for Degree-Bounded Directed Network Design
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Approximation algorithms for finding low-degree subgraphs
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Approximation algorithms for degree-constrained minimum-cost network-design problems
This page was built for publication:
