Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Finding Minimum Distance Preservers: A Parameterized Study
Kirill Simonov, Farehe Soheil, Shaily Verma
For a given graph and a subset of vertices , a \emph{distance preserver} is a subgraph of that preserves shortest paths between the vertices of . We distinguish betwe…
cs.DS2025
Binary -Center with Missing Entries: Structure Leads to Tractability
Farehe Soheil, Kirill Simonov, Tobias Friedrich
$\kC$ clustering is a fundamental classification problem, where the task is to categorize the given collection of entities into clusters and come up with a representative for e…
cs.DS2022
Tight analysis of the lazy algorithm for open online dial-a-ride
Julia Baligacs, Yann Disser, Farehe Soheil +1
In the open online dial-a-ride problem, a single server has to deliver transportation requests appearing over time in some metric space, subject to minimizing the completion time.…