Pages that link to "Item:Q703233"
From MaRDI portal
The following pages link to A better approximation algorithm for the budget prize collecting tree problem. (Q703233):
Displaying 6 items.
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees (Q6111962) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)