Pages that link to "Item:Q3020008"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP (Q3020008):
Displaying 9 items.
- Robust optimization for routing problems on trees (Q301384) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- (Q5009572) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
