Csaba D. Tóth

collaborators

Showing cs.CGShow all

4 papers · 1 filter

cs.CG2025

Approximating Euclidean Shallow-Light Trees

Hung Le, Shay Solomon, Cuong Than +2

For a weighted graph $G = (V, E, w)$ and a designated source vertex $s \in V$ , a spanning tree that simultaneously approximates a shortest-path tree w.r.t. source $s$ and a minimum…

cs.CG2025

Online Hitting Set for Axis-Aligned Squares

Minati De, Satyam Singh, Csaba D. Tóth

We are given a set $P$ of $n$ points in the plane, and a sequence of axis-aligned squares that arrive in an online fashion. The online hitting set problem consists of maintaining,…

cs.CG2025

The Price of Connectivity Augmentation on Planar Graphs

Hugo A. Akitaya, Justin Dallant, Erik D. Demaine +5

Given two classes of graphs, $G_{1} \subseteq G_{2}$ , and a $c$ -connected graph $G \in G_{1}$ , we wish to augment $G$ with a smallest cardinality set of new e…

cs.CG2024

Online Hitting Sets for Disks of Bounded Radii

Minati De, Satyam Singh, Csaba D. Tóth

We present algorithms for the online minimum hitting set problem in geometric range spaces: given a set $P$ of $n$ points in the plane and a sequence of geometric objects that arri…