Shrinking maxima, decreasing costs: new online packing and covering problems
From MaRDI portal
(Redirected from Publication:289907)
Recommendations
Cites work
- scientific article; zbMATH DE number 1263202 (Why is no real title available?)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Competitive router scheduling with structured data
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Independent sets with domination constraints
- On Multidimensional Packing Problems
- On the complexity of approximating \(k\)-set packing
- Online primal-dual algorithms for covering and packing
- Online scheduling with interval conflicts
- Online set packing
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Submodular secretary problem and extensions
- The Secretary Problem and Its Extensions: A Review
- The online set cover problem
Cited in
(9)- Distributed Testing of Distance-k Colorings
- Online multiset submodular cover
- Online constrained optimization with recourse
- Bicriteria algorithms to balance coverage and cost in team formation under online model
- Online bicriteria algorithms to balance coverage and cost in team formation
- Shrinking maxima, decreasing costs: new online packing and covering problems
- Algorithms – ESA 2005
- Overflow management with self-eliminations
- Overflow management with self-eliminations
This page was built for publication: Shrinking maxima, decreasing costs: new online packing and covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289907)
