Tight approximation algorithms for bichromatic graph diameter and related problems

Tight approximation algorithms for bichromatic graph diameter and related problems

© Graham Cormode, Jacques Dark, and Christian Konrad; licensed under Creative Commons License CC-BY Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a “center” node can reach all other no...

Full description

Bibliographic Details
Main Authors: Dalirrooyfard, Mina, Williams, Virginia Vassilevska, Vyas, Nikhil, Wein, Nicole
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/137631

Internet

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

Similar Items