Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632)
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 7378735
| 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 7378735 |
Statements
4 August 2021
0 references
QPTAS
0 references
planar graphs
0 references
Voronoi diagram
0 references
0 references
0 references
0 references
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (English)
0 references
