The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design

DOI10.1007/978-3-642-40164-0_18zbMath1391.90268OpenAlexW149515359MaRDI QIDQ2842783

Jérôme Monnot, Laurent Gourvès, Aris Pagourtzis

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40164-0_18

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (7)

Subset sum problems with digraph constraints ⋮ An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem ⋮ Online lazy bureaucrat scheduling with a machine deadline ⋮ In)approximability of Maximum Minimal FVS ⋮ (In)approximability of maximum minimal FVS ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation

This page was built for publication: The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design