Pages that link to "Item:Q4750653"
From MaRDI portal
The following pages link to On the Greedy Heuristic for Continuous Covering and Packing Problems (Q4750653):
Displaying 12 items.
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- Model-based view planning (Q1008495) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- The maximum clique problem (Q1318271) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)