An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs (Q6486925)
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 6370596
- An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs |
scientific article; zbMATH DE number 6370596 |
|
Statements
An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs (English)
0 references
An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (English)
0 references
18 November 2014
0 references
Steiner tree
0 references
approximation scheme
0 references
planar graphs
0 references
0.96938586
0 references
0.94971645
0 references
0 references
0 references
0.9270414
0 references
0.9264648
0 references
