A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274)
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 2241335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs |
scientific article; zbMATH DE number 2241335 |
Statements
A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (English)
0 references
27 December 2005
0 references
graph algorithms
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
coloring
0 references
weighted independent set
0 references
\(k\)-partite graphs
0 references
0 references
0.85539883
0 references
0.8531884
0 references
0.84748894
0 references
0 references
0.83735657
0 references
0.8364451
0 references
0.8347122
0 references
0.8343827
0 references
0.83353806
0 references
