Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems (Q2848922): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W117086416 / rank | |||
Normal rank | |||
Latest revision as of 00:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems |
scientific article |
Statements
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems (English)
0 references
13 September 2013
0 references
