Show simple item record

dc.contributor.authorBackurs, Arturs
dc.contributor.authorRoditty, Liam
dc.contributor.authorSegal, Gilad
dc.contributor.authorWilliams, Virginia Vassilevska
dc.contributor.authorWein, Nicole
dc.date.accessioned2022-07-21T16:33:40Z
dc.date.available2022-07-21T16:33:40Z
dc.date.issued2021
dc.identifier.urihttps://hdl.handle.net/1721.1/143939
dc.language.isoen
dc.publisherSociety for Industrial & Applied Mathematics (SIAM)en_US
dc.relation.isversionof10.1137/18M1226737en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceSIAMen_US
dc.titleToward Tight Approximation Bounds for Graph Diameter and Eccentricitiesen_US
dc.typeArticleen_US
dc.identifier.citationBackurs, Arturs, Roditty, Liam, Segal, Gilad, Williams, Virginia Vassilevska and Wein, Nicole. 2021. "Toward Tight Approximation Bounds for Graph Diameter and Eccentricities." SIAM Journal on Computing, 50 (4).
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.relation.journalSIAM Journal on Computingen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-07-21T16:30:06Z
dspace.orderedauthorsBackurs, A; Roditty, L; Segal, G; Williams, VV; Wein, Nen_US
dspace.date.submission2022-07-21T16:30:07Z
mit.journal.volume50en_US
mit.journal.issue4en_US
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record