Search Results for author:
Found 2 papers, 0 papers with code
Approximating Fair $k$-Min-Sum-Radii in $\mathbb{R}^d$
We propose a PTAS for the fair $k$-min-sum-radii problem in Euclidean spaces of arbitrary dimension for the case of constant $k$.
Reconfiguring Shortest Paths in Graphs
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
