Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963277542 / rank | |||
Normal rank | |||
Revision as of 19:16, 19 March 2024
scientific article; zbMATH DE number 7342471
| 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 7342471 |
Statements
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (English)
0 references
3 May 2021
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
