Approximation of the \(k\)-batch consolidation problem
From MaRDI portal
Publication:1006079
DOI10.1016/j.tcs.2008.11.007zbMath1162.90008MaRDI QIDQ1006079
Soo Y. Chang, Sung-Pil Hong, Myoung-Ju Park
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.007
approximation algorithm; inapproximability; \(k\)-batch consolidation problem; \(k\)-set cover problem
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90B30: Production models
68W25: Approximation algorithms
Related Items
Cites Work
- Unnamed Item
- Complexity of approximating bounded variants of optimization problems
- Approximation of a batch consolidation problem
- On the hardness of approximating minimization problems
- An approximation scheme for bin packing with conflicts
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
- On Bin Packing with Conflicts
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search