Partitioning ideal sets

DOI10.1080/00207169908804812zbMath0961.90086OpenAlexW2081575358MaRDI QIDQ4254655

Jacob Shapiro, Robert R. Goldberg

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

scheduling theorymathematical programmingNP-completeworst-case analysis

Mathematics Subject Classification ID

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

Cites Work

• Tighter bounds on a heuristic for a partition problem
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning ideal sets