Pages that link to "Item:Q2345942"
From MaRDI portal
The following pages link to Approximating minimum-cost connected \(T\)-joins (Q2345942):
Displaying 7 items.
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Minimum $T$-Joins and Signed-Circuit Covering (Q5112825) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- (Q6065419) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
