The following pages link to Primal-dual meets local search (Q3581300):
Displaying 8 items.
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- Approximation algorithms for finding low-degree subgraphs (Q4651931) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- (Q5743495) (← links)