Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
description / en | description / en | ||
Revision as of 16:11, 2 May 2024
No description defined
Language | Label | Description | Also known as |
---|---|---|---|
English | Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces |
No description defined |
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