The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
From MaRDI portal
Publication:5902163
DOI10.1007/978-3-642-03685-9_7zbMath1254.90068OpenAlexW1646436690MaRDI QIDQ5902163
Publication date: 28 October 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/138162
Related Items (3)
Black-box reductions for cost-sharing mechanism design ⋮ Single parameter analysis of power of preemption on two and three uniform machines ⋮ Unnamed Item
This page was built for publication: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders