A truthful constant approximation for maximizing the minimum load on related machines (Q388122): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6239365 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithmic mechanism design | |||
| Property / zbMATH Keywords: algorithmic mechanism design / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
machine covering | |||
| Property / zbMATH Keywords: machine covering / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithms | |||
| Property / zbMATH Keywords: approximation algorithms / rank | |||
Normal rank | |||
Revision as of 13:24, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A truthful constant approximation for maximizing the minimum load on related machines |
scientific article |
Statements
A truthful constant approximation for maximizing the minimum load on related machines (English)
0 references
19 December 2013
0 references
algorithmic mechanism design
0 references
scheduling
0 references
machine covering
0 references
approximation algorithms
0 references
