Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces

Kisfaludi-Bak, Sándor; Nederlof, Jesper; van Leeuwen, Erik Jan

doi:10.1145/3371389

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_3266063_3

DetailsSummary

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces

Kisfaludi-Bak, S., Nederlof, J., & van Leeuwen, E. J. (2020). Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Transactions on Algorithms, 16(3): 28. doi:10.1145/3371389.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0007-7796-A Version Permalink: https://hdl.handle.net/21.11116/0000-0007-D2B2-2

Genre: Journal Article

Latex : Nearly {ETH}-tight Algorithms for Planar {Steiner} Tree with Terminals on Few Faces

Files

show Files

Locators

show

Creators

show

hide

Creators:
Kisfaludi-Bak, Sándor¹, Author
Nederlof, Jesper², Author
van Leeuwen, Erik Jan², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2020

Publication Status: Published online

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Kisfaludi-BakNL20b
DOI: 10.1145/3371389

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: ACM Transactions on Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : ACM

Pages: 30 p. Volume / Issue: 16 (3) Sequence Number: 28 Start / End Page: - Identifier: ISSN: 1549-6325
CoNE: https://pure.mpg.de/cone/journals/resource/111088195282718