English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
/persons/resource/persons252857

Kisfaludi-Bak,  Sándor
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/21.11116/0000-0007-7796-A
Abstract
There is no abstract available