A 3/2-approximation algorithm for k_i-partitioning
From MaRDI portal
Publication:408403
DOI10.1016/J.ORL.2011.06.005zbMATH Open1235.90063OpenAlexW2034931448MaRDI QIDQ408403FDOQ408403
Authors: Hans Kellerer, V. M. Kotov 
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.005
Recommendations
- The \(k\)-partitioning problem
- \(k\)-partitioning problems with partition matroid constraint
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
- An approximation algorithm for scheduling on three dedicated machines
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (14)
- Online cardinality constrained scheduling
- Operations research models for coalition structure in collaborative logistics
- A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
- An efficient PTAS for parallel machine scheduling with capacity constraints
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
- A tight bound for 3-partitioning
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint
- Dividing splittable goods evenly and with limited fragmentation
- A new approach for bicriteria partitioning problem
- Domination analysis for minimum multiprocessor scheduling
- Three-partitioning containing kernels: Complexity and heuristic
- The \(k\)-partitioning problem
- Three Partition Refinement Algorithms
- EPTAS for parallel identical machine scheduling with time restrictions
This page was built for publication: A 3/2-approximation algorithm for \(k_i\)-partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408403)
