Showing 2021Show all
2 papers · 1 filter
cs.CC2021
Hardness of Approximate Diameter: Now for Undirected Graphs
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Approximating the graph diameter is a basic task of both theoretical and practical interest. A simple folklore algorithm can output a 2-approximation to the diameter in linear time…
cs.DS2021
Approximation Algorithms for Min-Distance Problems in DAGs
Mina Dalirrooyfard, Jenny Kaufmann
The min-distance between two nodes is defined as the minimum of the distance from to or from to , and is a natural distance metric in DAGs. As with the standa…