The following pages link to Primal-dual meets local search (Q3581300):
Displayed 3 items.
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- Approximation algorithms for finding low-degree subgraphs (Q4651931) (← links)