English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

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.

Item is

Basic

show hide
Genre: Journal Article
Latex : Network Sparsification for {Steiner} Problems on Planar and Bounded-Genus Graphs

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Pilipczuk, Marcin1, Author
Pilipczuk, Michał1, Author
Sankowski, Piotr1, Author
van Leeuwen, Erik Jan2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 201420182018
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: PilipzukTOA2018
DOI: 10.1145/3239560
 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: - Volume / Issue: 14 (4) Sequence Number: 53 Start / End Page: - Identifier: ISSN: 1549-6325
CoNE: https://pure.mpg.de/cone/journals/resource/111088195282718