Pages that link to "Item:Q5317173"
From MaRDI portal
The following pages link to Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds (Q5317173):
Displayed 15 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Multi-objective Problems in Terms of Relational Algebra (Q3498407) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)