Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245)
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 schemes for packing and covering problems in planar graphs |
scientific article; zbMATH DE number 7189182
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs |
scientific article; zbMATH DE number 7189182 |
Statements
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (English)
0 references
14 April 2020
0 references
approximation schemes
0 references
planar graphs
0 references
independent set of objects
0 references
geometric set cover
0 references
0 references
0 references
0 references
0.9999998
0 references
0.91439056
0 references
0.91358393
0 references
0.9097788
0 references
0.9059615
0 references
0.9056249
0 references
0.9047805
0 references
0 references
