- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines ; day:30 ; month:5 ; year:2019 ; pages:1-28
Theory of computing systems ; (30.5.2019), 1-28
- Creator
-
Kuryatnikova, Olga
Vera, Juan C.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-019-09927-x
- URN
-
urn:nbn:de:101:1-2019102019051639763041
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kuryatnikova, Olga
- Vera, Juan C.
- SpringerLink (Online service)
Other Objects (12)
Scheduling unrelated machines by randomized rounding
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines: linear programming strikes back.
Approximability of average completion time scheduling on unrelated machines
On the Configuration-LP for Scheduling on Unrelated Machines
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A PTAS for Scheduling Unrelated Machines of Few Different Types
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Coordinating selfish players in scheduling games
Unrelated Machine Scheduling in Different Information Models
Exact and metaheuristic approaches for unrelated parallel machine scheduling
Scheduling unrelated machines by randomized rounding
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines: linear programming strikes back.
Approximability of average completion time scheduling on unrelated machines
On the Configuration-LP for Scheduling on Unrelated Machines
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A PTAS for Scheduling Unrelated Machines of Few Different Types
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Coordinating selfish players in scheduling games
Unrelated Machine Scheduling in Different Information Models
Exact and metaheuristic approaches for unrelated parallel machine scheduling
Scheduling unrelated machines by randomized rounding
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines: linear programming strikes back.
Approximability of average completion time scheduling on unrelated machines
On the Configuration-LP for Scheduling on Unrelated Machines
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A PTAS for Scheduling Unrelated Machines of Few Different Types
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Coordinating selfish players in scheduling games
Unrelated Machine Scheduling in Different Information Models