An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186)
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: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs |
scientific article; zbMATH DE number 5586539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs |
scientific article; zbMATH DE number 5586539 |
Statements
An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (English)
0 references
24 July 2009
0 references
approximation algorithms
0 references
dispersion
0 references
factor-revealing linear programs
0 references
remote-clique
0 references
0 references
0 references
0 references
0.85516924
0 references
0.83096945
0 references
0 references
0.82677335
0 references
0.82592887
0 references
0.8251111
0 references
0 references
0.8221016
0 references
0.82163525
0 references
