Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446)
From MaRDI portal
(Redirected from Item:Q5236247)
 | 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: Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces |
scientific article; zbMATH DE number 7117412
- Nearly ETH-tight algorithms for P<scp>lanar</scp> S<scp>teiner</scp> T<scp>ree</scp> with Terminals on Few Faces
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces |
scientific article; zbMATH DE number 7117412 |
|
Statements
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (English)
0 references
Nearly ETH-tight algorithms for P<scp>lanar</scp> S<scp>teiner</scp> T<scp>ree</scp> with Terminals on Few Faces (English)
0 references
3 May 2021
0 references
15 October 2019
0 references
planar graphs
0 references
Steiner tree
0 references
exact algorithms
0 references
exponential time hypothesis
0 references
lower bound
0 references
parameterized algorithms
0 references
1.0000001
0 references
0.9032554
0 references
0.90285224
0 references
0.8949229
0 references
0.8928738
0 references
0.8927508
0 references
