✦ LIBER ✦

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

✍ Scribed by Nir Andelman; Yossi Azar; Motti Sorani

Publisher: Springer
Year: 2007
Tongue: English
Weight: 168 KB
Volume: 40
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-006-1316-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Truthful Mechanisms for Selfish Routing

Truthful Mechanisms for Selfish Routing and

✍ Clemens Thielen; Sven O. Krumke 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 824 KB

On truthfulness and approximation for sc

On truthfulness and approximation for scheduling selfish tasks

✍ Eric Angel; Evripidis Bampis; Fanny Pascual; Alex-Ariel Tchetgnia 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 364 KB

Approximation Schemes for Scheduling on

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

✍ Leah Epstein hanks{School of Computer Science, The Interdisciplinary Center, Her 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 165 KB

Approximations and auctions for scheduli

Approximations and auctions for scheduling batches on related machines

✍ Tamás Kis; Richárd Kápolnai 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Approximation schemes for scheduling on

Approximation schemes for scheduling on parallel machines

✍ Noga Alon; Yossi Azar; Gerhard J. Woeginger; Tal Yadid 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 124 KB 👁 1 views

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which

Approximation algorithms for scheduling

Approximation algorithms for scheduling unrelated parallel machines

✍ Jan Karel Lenstra; David B. Shmoys; Éva Tardos 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 751 KB