Approximation algorithms for NP-complete problems on planar graphs (Q4299299): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/174644.174650 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2156760067 / rank | |||
Normal rank | |||
Revision as of 22:01, 19 March 2024
scientific article; zbMATH DE number 598341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for NP-complete problems on planar graphs |
scientific article; zbMATH DE number 598341 |
Statements
Approximation algorithms for NP-complete problems on planar graphs (English)
0 references
1 March 1995
0 references
maximum H-matching
0 references
approximation schemes
0 references
maximum independent set
0 references
maximum tile salvage
0 references
minimum vertex cover
0 references
minimum dominating set
0 references
minimum edge dominating set
0 references
