ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Article URLs:
Alternative Article URLs:
Authors: Rajesh Hemant Chitnis
  • University of Maryland at College Park, USA, Department of Computer Science
MohammadTaghi Hajiaghayi
  • University of Maryland at College Park, USA, Department of Computer Science
Dániel Marx
  • Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary., Computer and Automation Research Institute
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1053605, 1161626
DBLP Key: conf/soda/ChitnisHM14
Author Comments:

Discuss this paper and its artifacts below