Approximating the minimum hub cover problem on planar graphs (Q5963689)
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: Approximating the minimum hub cover problem on planar graphs |
scientific article; zbMATH DE number 6544378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimum hub cover problem on planar graphs |
scientific article; zbMATH DE number 6544378 |
Statements
Approximating the minimum hub cover problem on planar graphs (English)
0 references
23 February 2016
0 references
approximation algorithm
0 references
query processing
0 references
subgraph isomorphism
0 references
planar graph decomposition
0 references
minimum hub cover problem
0 references
0 references
0.9076444
0 references
0.89955515
0 references
0.89578676
0 references
0.8947538
0 references
0.8915049
0 references
0.8910897
0 references
