A new approximation algorithm for finding heavy planar subgraphs (Q1400892)
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: A new approximation algorithm for finding heavy planar subgraphs |
scientific article; zbMATH DE number 1964903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approximation algorithm for finding heavy planar subgraphs |
scientific article; zbMATH DE number 1964903 |
Statements
A new approximation algorithm for finding heavy planar subgraphs (English)
0 references
17 August 2003
0 references
Weighted planar graph
0 references
Approximation algorithm
0 references
Performance ratio
0 references
0.9410774
0 references
0.93100893
0 references
0.9225992
0 references
0.90908015
0 references
0.90834993
0 references
0.9074366
0 references
0.9069217
0 references
