English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)

Chitnis, R. H., Feldmann, A. E., HajiAghayi, M., & Marx, D. (2020). Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM Journal on Computing, 49(2), 318-364. doi:10.1137/18M122371X.

Item is

Basic

show hide
Genre: Journal Article
Latex : Tight Bounds for Planar Strongly Connected {Steiner} Subgraph with Fixed Number of Terminals (and Extensions)

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Chitnis, Rajesh H.1, Author
Feldmann, Andreas E.1, Author
HajiAghayi, MohammadTaghi 1, Author
Marx, Daniel2, 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: 20202020
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/18M122371X
BibTex Citekey: Chitnis2020
 Degree: -

Event

show

Legal Case

show

Project information

show hide
Project name : SYSTEMATICGRAPH
Grant ID : 725978
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)
Project name : PARAMTIGHT
Grant ID : 280152
Funding program : Funding Programme 7 (FP7)
Funding organization : European Commission (EC)

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Philadelphia : Society for Industrial and Applied Mathematics.
Pages: - Volume / Issue: 49 (2) Sequence Number: - Start / End Page: 318 - 364 Identifier: ISSN: 0097-5397
CoNE: https://pure.mpg.de/cone/journals/resource/954925466249