Approximation algorithms for min-distance problems by Williams, Virginia Vassilevska, Wein, Nicole, Dalirrooyfard, Mina, Vyas, Nikhil, Xu, Yinzhan, Yu, Yuancheng

Get full text

Conditionally optimal approximation algorithms for the girth of a directed graph by Dalirrooyfard, Mina, Williams, Virginia Vassilevska

“…Fast good quality approximation algorithms for undirected graphs have been known for decades. …”
Get full text

Tight approximation algorithms for bichromatic graph diameter and related problems by Dalirrooyfard, Mina, Williams, Virginia Vassilevska, Vyas, Nikhil, Wein, Nicole

“…We give the first nontrivial approximation algorithms for most of these problems, including time/accuracy trade-off upper and lower bounds. …”
Get full text

Finding Patterns, Short Cycles and Long Shortest Paths in Graphs by Dalirrooyfard, Mina

“…Our result shows that any better than 2-approximation algorithm for the diameter requires super linear time. …”
Get full text