2 papers
cs.DS2026
New Diameter Approximations via Distance Oracle Techniques
Yael Kirkpatrick, Liam Roditty, Richard Qi +1
Computing the diameter of a graph is a problem of great interest both in general algorithms research and specifically within fine-grained complexity, where it is a cornerstone hard…
cs.CG2023
New Approximation Algorithms for Touring Regions
Benjamin Qi, Richard Qi, Xinyang Chen
We analyze the touring regions problem: find a ()-approximate Euclidean shortest path in -dimensional space that starts at a given starting point, ends at a given ending po…