Tighter bounds on a heuristic for a partition problem
From MaRDI portal
Publication:1350239
DOI10.1016/0020-0190(95)00099-XzbMath0875.68460MaRDI QIDQ1350239
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Algorithms; NP-hard; Approximation algorithms; Partition; Discrete minimization; Storage allocation; Worst-case bound
68W10: Parallel algorithms in computer science
Related Items
An efficient polynomial time approximation scheme for load balancing on uniformly related machines, An analysis of the LPT algorithm for the max-min and the min-ratio partition problems, A new model for selfish routing, A tight upper bound for the \(k\)-partition problem on ideal sets, Partitioning under the \(L_p\) norm, Extending Graham's result on scheduling to other heuristics, An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines, Designing PTASs for MIN-SUM scheduling problems, Load balancing of temporary tasks in the \(\ell _{p}\) norm, Partitioning ideal sets
Cites Work