Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks

DOI10.1016/0012-365X(93)90358-ZzbMath0776.68054MaRDI QIDQ685660

Mark Chaimovich

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximate algorithms\(k\)-partition problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• New analytical results in subset-sum problem
• On two additive problems
• Subset-sum problems with different summands: Computation
• An introduction to the analysis of approximation algorithms
• On sums of subsets of a set of integers
• Solving dense subset-sum problems by using analytical number theory
• On representation of r-th powers by subset sums
• Algorithms for Scheduling Independent Tasks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks