Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; van Leeuwen, Erik Jan

doi:10.1145/3239560

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

MPS-Authors

/persons/resource/persons98374

van Leeuwen, Erik Jan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Pilipczuk, M., Pilipczuk, M., Sankowski, P., & van Leeuwen, E. J. (2018). Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Transactions on Algorithms, 14(4): 53. doi:10.1145/3239560.

Cite as: https://hdl.handle.net/21.11116/0000-0002-F70C-B

Abstract

There is no abstract available