Partitioning ideal sets

DOI10.1080/00207169908804812MaRDI QIDQ4254655zbMATH OpenOpenAlexFDO

Authors Robert R. Goldberg, Jacob Shapiro

Publication date 29 June 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804812

zbMATH Keywords

mathematical programmingNP-completescheduling theoryworst-case analysis

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Partitioning under the \(L_p\) norm
• A tight upper bound for the \(k\)-partition problem on ideal sets
• The \(k\)-partitioning problem

Cites work

• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (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

(8)

• A tight upper bound for the \(k\)-partition problem on ideal sets
• Tighter bounds on a heuristic for a partition problem
• Partitioning under the \(L_p\) norm
• scientific article; zbMATH DE number 3908442 (Why is no real title available?)
• scientific article; zbMATH DE number 1472145 (Why is no real title available?)
• scientific article; zbMATH DE number 1559404 (Why is no real title available?)
• On some similarity of finite sets (and what we can say today about certain old problem)
• A performance guarantee for the greedy set-partitioning algorithm

This page was built for publication: Partitioning ideal sets

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