Approximation algorithms for min-distance problems

Approximation algorithms for min-distance problems

© Graham Cormode, Jacques Dark, and Christian Konrad; licensed under Creative Commons License CC-BY We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when distances are measured using a somewhat unorthodox but natural measure: the distance between u and v is t...

Full description

Bibliographic Details
Main Authors: Williams, Virginia Vassilevska, Wein, Nicole, Dalirrooyfard, Mina, Vyas, Nikhil, Xu, Yinzhan, Yu, Yuancheng
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: 2021
Online Access:https://hdl.handle.net/1721.1/137487

Internet

https://hdl.handle.net/1721.1/137487

Similar Items