ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Better Approximation Algorithms for the Graph Diameter
Article URLs:
Alternative Article URLs:
Authors: Shiri Chechik
  • Microsoft Research, SVC
Daniel H. Larkin
  • Princeton University
Liam Roditty
  • Bar Ilan University
Grant Schoenebeck
  • University of Michigan
Robert Endre Tarjan
  • Princeton University
  • Microsoft Research, SVC
Virginia Vassilevska Williams
  • Stanford University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 0830797, 1118083, 0963478, 0904325, 0832797
DBLP Key: conf/soda/ChechikLRSTW14
Author Comments:

Discuss this paper and its artifacts below