Streaming euclidean mst to a constant factor
We study streaming algorithms for the fundamental geometric problem of computing the cost
of the Euclidean Minimum Spanning Tree (MST) on an n-point set X⊂ ℝ d. In the streaming …
of the Euclidean Minimum Spanning Tree (MST) on an n-point set X⊂ ℝ d. In the streaming …
Streaming facility location in high dimension via geometric hashing
In Euclidean Uniform Facility Location, the input is a set of clients in R^d and the goal is to
place facilities to serve them, so as to minimize the total cost of opening facilities plus …
place facilities to serve them, so as to minimize the total cost of opening facilities plus …
Streaming Euclidean max-cut: Dimension vs data reduction
Max-Cut is a fundamental problem that has been studied extensively in various settings. We
design an algorithm for Euclidean Max-Cut, where the input is a set of points in ℝ d, in the …
design an algorithm for Euclidean Max-Cut, where the input is a set of points in ℝ d, in the …
On streaming algorithms for geometric independent set and clique
We study the maximum geometric independent set and clique problems in the streaming
model. Given a collection of geometric objects arriving in an insertion only stream, the aim is …
model. Given a collection of geometric objects arriving in an insertion only stream, the aim is …
Streaming Euclidean MST to a Constant Factor
We study streaming algorithms for the fundamental geometric problem of computing the cost
of the Euclidean Minimum Spanning Tree (MST) on an $ n $-point set $ X\subset\mathbb …
of the Euclidean Minimum Spanning Tree (MST) on an $ n $-point set $ X\subset\mathbb …
Random-Order Online Independent Set of Intervals and Hyperrectangles
M Garg, D Kar, A Khan - 32nd Annual European Symposium on …, 2024 - drops.dagstuhl.de
Abstract In the Maximum Independent Set of Hyperrectangles problem, we are given a set of
n (possibly overlapping) d-dimensional axis-aligned hyperrectangles, and the goal is to find …
n (possibly overlapping) d-dimensional axis-aligned hyperrectangles, and the goal is to find …
Model-Agnostic Approximation of Constrained Forest Problems
C Coupette, A Montaseri, C Lenzen - arXiv preprint arXiv:2407.14536, 2024 - arxiv.org
Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995
capture a wide range of network design problems with edge subsets as solutions, such as …
capture a wide range of network design problems with edge subsets as solutions, such as …
Random-Order Online Interval Scheduling and Geometric Generalizations
M Garg, D Kar, A Khan - arXiv preprint arXiv:2402.14201, 2024 - arxiv.org
In the Maximum Independent Set of Hyperrectangles problem, we are given a set of $ n
$(possibly overlapping) $ d $-dimensional axis-aligned hyperrectangles, and the goal is to …
$(possibly overlapping) $ d $-dimensional axis-aligned hyperrectangles, and the goal is to …