Equivalence of two linear programming relaxations for broadcast scheduling. (Q703264)
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: Equivalence of two linear programming relaxations for broadcast scheduling. |
scientific article; zbMATH DE number 2125908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of two linear programming relaxations for broadcast scheduling. |
scientific article; zbMATH DE number 2125908 |
Statements
Equivalence of two linear programming relaxations for broadcast scheduling. (English)
0 references
11 January 2005
0 references
approximation algorithms
0 references
0 references
0.8023422956466675
0 references
0.7687535881996155
0 references
0.7510995268821716
0 references
