A PTAS for scheduling unrelated machines of few different types (Q5895057)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A PTAS for scheduling unrelated machines of few different types |
scientific article; zbMATH DE number 6909731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A PTAS for scheduling unrelated machines of few different types |
scientific article; zbMATH DE number 6909731 |
Statements
A PTAS for Scheduling Unrelated Machines of Few Different Types (English)
0 references
24 July 2018
0 references
scheduling on unrelated machines
0 references
scheduling on unrelated machines of few different types
0 references
polynomial time approximation scheme
0 references
PTAS
0 references
approximation algorithm
0 references
single exponential in approximation ratio
0 references
0 references
0 references
0 references
0.9966909885406494
0 references
0.8561298251152039
0 references
