Approximation algorithms for NP-complete problems on planar graphs (Q4299299): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55934692, #quickstatements; #temporary_batch_1704767531357 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:23, 6 February 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
