Publication:4987446: Difference between revisions
From MaRDI portal
Publication:4987446
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces to Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces: Duplicate |
(No difference)
| |
Latest revision as of 16:11, 2 May 2024
DOI10.1145/3371389zbMath1484.68166arXiv1811.06871OpenAlexW2963277542MaRDI QIDQ4987446
Erik Jan van Leeuwen, Sándor Kisfaludi-Bak, Jesper Nederlof
Publication date: 3 May 2021
Published in: ACM Transactions on Algorithms, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06871
planar graphslower boundSteiner treeparameterized algorithmsexact algorithmsexponential time hypothesis
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs, The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds, Implications, conflicts, and reductions for Steiner trees, On Geometric Set Cover for Orthants, Implications, conflicts, and reductions for Steiner trees, A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
