2026· International Colloquium on Automata, Languages and Programming· pp. 34:1-34:21· 0 citations· 29 references
Computer Science
TL;DR
This approach integrates a classic grid-based partition framework with a novel charging analysis that controls the cost of structure-sensitive offline routines within each cell, to perform a global aggregation of the update time, by circumventing the worst-case costs associated with individual cell updates.
We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number $k$, select $k$ objects maximizing the number of points inside their union. - We present a polynomial-time approximation algorithm with approximation factor strictly better than $1-1/e$ for a...
S. Bhore, Timothy M. Chan, Pasin Manurangsi· arXiv.org· 0 citations
This paper provides a tight reduction demonstrating that any exact distance sensitivity oracle can be used to efficiently solve decremental exact diameter and all-node eccentricities and introduces two new instructive techniques and demonstrates how to utilize them to construct several new algorithms.
Sam Hiken, Yael Kirkpatrick, Jakob Nogler et al.· 0 citations
We study the space complexity of diameter estimation for a set of points in Euclidean space in the dynamic (turnstile) streaming model. The seminal work of Indyk (SODA 2003) gives a $c$-approximation to the Euclidean diameter of $n$ vectors using $n^{O(1/c^2)}$ space. Our main contribution is giving an essentially matc...
Ashwin Padaki, Krish Singal, Erik Waingarten· 0 citations
Partial optimal transport compares two measures while leaving part of the mass unmatched, which is what makes it robust to outliers, occlusion, and clutter. The quantity of interest is usually the whole profile - the optimal cost at every transported cardinality - because the right amount to transport is rarely known i...
Condat's algorithm is an efficient dynamic-threshold method for projection onto the simplex, but its extension to weighted equality constraints and the algorithmic roles of resetting and removal have received limited analysis. We develop a dynamic-threshold algorithm (DTA) for a continuous quadratic knapsack problem wi...
An exact transcript-cone game yields one uniform interpreter whose charged addition-comparison cost equals one uniform interpreter whose optimal actions are synthesizable in polynomial space but may require exponential time.
Bin Cai· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
