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

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

doi:10.1137/1.9781611975482.63

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

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

Not published at Aalto University

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

4 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Publisher	Society for Industrial and Applied Mathematics
Pages	1015-1034
Number of pages	20
ISBN (Print)	9781611975482
DOIs	https://doi.org/10.1137/1.9781611975482.63
Publication status	Published - 2019
MoE publication type	A4 Conference publication
Event	ACM-SIAM Symposium on Discrete Algorithms - San Diego, United States Duration: 6 Jan 2019 → 9 Jan 2019 Conference number: 30

Conference

Conference	ACM-SIAM Symposium on Discrete Algorithms
Abbreviated title	SODA
Country/Territory	United States
City	San Diego
Period	06/01/2019 → 09/01/2019

Access to Document

10.1137/1.9781611975482.63

Cite this

@inproceedings{db307a12d544408aa60a04cdf363e244,

title = "Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces",

author = "S{\'a}ndor Kisfaludi-Bak and Jesper Nederlof and {Van Leeuwen}, {Erik Jan}",

note = "Funding Information: Supported by the Netherlands Organization for Scientific Research NWO under project no. 024.002.003 and 639.021.438. Publisher Copyright: Copyright {\textcopyright} 2019 by SIAM; ACM-SIAM Symposium on Discrete Algorithms, SODA ; Conference date: 06-01-2019 Through 09-01-2019",

year = "2019",

doi = "10.1137/1.9781611975482.63",

language = "English",

isbn = "9781611975482",

pages = "1015--1034",

booktitle = "Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)",

publisher = "Society for Industrial and Applied Mathematics",

address = "United States",

}

Kisfaludi-Bak, S, Nederlof, J & Van Leeuwen, EJ 2019, Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. in Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 1015-1034, ACM-SIAM Symposium on Discrete Algorithms, San Diego, California, United States, 06/01/2019. https://doi.org/10.1137/1.9781611975482.63

Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. / Kisfaludi-Bak, Sándor; Nederlof, Jesper; Van Leeuwen, Erik Jan.
Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2019. p. 1015-1034.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

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

AU - Kisfaludi-Bak, Sándor

AU - Nederlof, Jesper

AU - Van Leeuwen, Erik Jan

N1 - Conference code: 30

PY - 2019

Y1 - 2019

U2 - 10.1137/1.9781611975482.63

DO - 10.1137/1.9781611975482.63

M3 - Conference article in proceedings

AN - SCOPUS:85066951976

SN - 9781611975482

SP - 1015

EP - 1034

BT - Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

PB - Society for Industrial and Applied Mathematics

T2 - ACM-SIAM Symposium on Discrete Algorithms

Y2 - 6 January 2019 through 9 January 2019

ER -