Pages that link to "Item:Q5171192"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP (Q5171192):
Displaying 4 items.
- On the approximability of dense Steiner problems (Q396661) (← links)
- A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
