On the Structure of Optimal Greedy Computation (for Job Scheduling)

DOI10.1007/978-3-642-03816-7_52zbMath1250.68130OpenAlexW1604485141MaRDI QIDQ3182959

Periklis A. Papakonstantinou

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_52

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Hierarchies for classes of priority algorithms for job scheduling
• Characterizing sets of jobs that admit optimal greedy-like algorithms
• (Incremental) priority algorithms
• Priority algorithms for makespan minimization in the subset model.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An Exact Characterization of Greedy Structures
• Matroids and the greedy algorithm
• Automata, Languages and Programming
• Approximation and Online Algorithms