On lazy bureaucrat scheduling with common deadlines
From MaRDI portal
Publication:2427440
DOI10.1007/s10878-007-9076-2zbMath1138.90394MaRDI QIDQ2427440
Publication date: 13 May 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9076-2
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- An approximation algorithm for the maximum traveling salesman problem
- On approximating the longest path in a graph
- The lazy bureaucrat scheduling problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Algorithms and Data Structures