Algorithms – ESA 2005
From MaRDI portal
Publication:5475870
DOI10.1007/11561071zbMath1162.90459OpenAlexW2501059503MaRDI QIDQ5475870
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Related Items (22)
A survey on makespan minimization in semi-online environments ⋮ Truthful mechanism design for multidimensional scheduling via cycle monotonicity ⋮ On designing truthful mechanisms for online scheduling ⋮ Private Capacities in Mechanism Design ⋮ Approximations and auctions for scheduling batches on related machines ⋮ Truthful algorithms for scheduling selfish tasks on parallel machines ⋮ Well-behaved online load balancing against strategic jobs ⋮ Distributed algorithmic mechanism design for scheduling on unrelated machines ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ Truthful mechanism design via correlated tree rounding ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ Multistage interval scheduling games ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ The power of verification for one-parameter agents ⋮ Preemptive Scheduling on Selfish Machines ⋮ Maximizing the Minimum Load for Selfish Agents ⋮ Truthful mechanisms for two-range-values variant of unrelated scheduling ⋮ Tighter approximation bounds for LPT scheduling in two special cases ⋮ A lower bound for scheduling mechanisms ⋮ Maximizing the minimum load for selfish agents
This page was built for publication: Algorithms – ESA 2005
