Partitioning under the L_p norm

DOI10.1016/S0377-2217(99)00112-5MaRDI QIDQ1572977zbMATH OpenOpenAlexFDO

Authors Robert R. Goldberg, Jacob Shapiro

Publication date 14 February 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(99)00112-5

zbMATH Keywords

mathematical programmingNP-completescheduling theoryworst-case analysis

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Marketing, advertising (90B60)

Recommendations

• Partitioning ideal sets
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
• A tight upper bound for the \(k\)-partition problem on ideal sets
• scientific article; zbMATH DE number 1472145
• scientific article; zbMATH DE number 1185313

Cites work

• Bounds on Multiprocessing Timing Anomalies
• scientific article; zbMATH DE number 41026 (Why is no real title available?)
• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 6472625 (Why is no real title available?)
• Tighter bounds on a heuristic for a partition problem
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation

Cited in

(9)

• A tight upper bound for the \(k\)-partition problem on ideal sets
• Extending Graham's result on scheduling to other heuristics
• \(\kappa\)-partitioning problems for maximizing the minimum load
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
• scientific article; zbMATH DE number 1185313 (Why is no real title available?)
• Partitioning ideal sets
• scientific article; zbMATH DE number 1472145 (Why is no real title available?)
• A performance guarantee for the greedy set-partitioning algorithm

This page was built for publication: Partitioning under the \(L_p\) norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1572977)