Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2165431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conversion of coloring algorithms into maximum weight independent set algorithms |
scientific article; zbMATH DE number 2165431 |
Statements
Conversion of coloring algorithms into maximum weight independent set algorithms (English)
0 references
4 May 2005
0 references
Approximation algorithms
0 references
Weighted independent set
0 references
Edge-disjoint paths
0 references
Path coloring
0 references
Time-constrained packet scheduling
0 references
Linear programming
0 references
0 references
0 references
0.7990997433662415
0 references
0.7851939797401428
0 references
0.7848561406135559
0 references
0.7808771729469299
0 references
0.7801703810691833
0 references
