Quasi-polynomial time approximation scheme for sparse subsets of polygons (Q4635534)
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: Quasi-polynomial time approximation scheme for sparse subsets of polygons |
scientific article; zbMATH DE number 6863009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-polynomial time approximation scheme for sparse subsets of polygons |
scientific article; zbMATH DE number 6863009 |
Statements
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons (English)
0 references
23 April 2018
0 references
approximation algorithms
0 references
independent set
0 references
QPTAS
0 references
0.893616795539856
0 references
0.8139104843139648
0 references
0.7637186646461487
0 references
0.7630887627601624
0 references
0.7616531252861023
0 references
