ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
Article URLs:
Alternative Article URLs:
Authors: Eden Chlamtác
  • Ben-Gurion University of the Negev
Michael Dinitz
  • Johns Hopkins University
Guy Kortsarz
  • Rutgers University - Camden
Bundit Laekhanukit
  • Weizmann Institute of Science
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1464239, 1535887, 1218620, 1540547
DBLP Key: conf/soda/ChlamtacDKL17
Author Comments:

Discuss this paper and its artifacts below