Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs |
scientific article |
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
