ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: Towards tight approximation bounds for graph diameter and eccentricities
Article URLs:
Alternative Article URLs:
Authors: Arturs Backurs
  • MIT
Liam Roditty
  • Bar Ilan University
Gilad Segal
  • Bar Ilan University
Virginia Vassilevska Williams
  • MIT
Nicole Wein
  • MIT
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: unknown, 1417238, 1528078, 1514339
DBLP Key: conf/stoc/BackursRSWW18
Author Comments:

Discuss this paper and its artifacts below