Algorithms and Data Structures

DOI10.1007/b11837zbMath1278.90153MaRDI QIDQ5900742

Ali Sharifi, Mohammad Ghodsi, Behdad Esfahbod

Publication date: 20 April 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic programming; scheduling problems; approximation algorithms; NP-hardness

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Related Items

Subset sum problems with digraph constraints, Online lazy bureaucrat scheduling with a machine deadline, On lazy bureaucrat scheduling with common deadlines