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) Merged Item from Q5236247 |
||||||||||||||
(One intermediate revision by the same user not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Nearly ETH-tight algorithms for P<scp>lanar</scp> S<scp>teiner</scp> T<scp>ree</scp> with Terminals on Few Faces | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number | scientific article; zbMATH DE number 7117412 | ||||||||||||||
Property / title | |||||||||||||||
Nearly ETH-tight algorithms for P<scp>lanar</scp> S<scp>teiner</scp> T<scp>ree</scp> with Terminals on Few Faces (English) | |||||||||||||||
Property / title: Nearly ETH-tight algorithms for P<scp>lanar</scp> S<scp>teiner</scp> T<scp>ree</scp> with Terminals on Few Faces (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1431.68095 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1137/1.9781611975482.63 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
15 October 2019
| |||||||||||||||
Property / publication date: 15 October 2019 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 7117412 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2901129848 / rank | |||||||||||||||
Normal rank |
Latest revision as of 10:22, 6 May 2024
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