Approximation algorithms for NP-complete problems on planar graphs (Q4299299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 598341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9166871
0 references
0.9157878
0 references
0.9099657
0 references
0 references
0.90574884
0 references
0.9051404
0 references
