This paper presents a randomized algorithm that runs in $ ilde{O}(n^2)$ time and, with high probability, guarantees a 2-approximation for all pairs at distance at least $c$ in an undirected, unweighte…

This paper introduces approximation-preserving coresets, which provide weaker guarantees than strong coresets but stronger guarantees than weak coresets for preserving the costs of good solutions in b…

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

This paper introduces structured cut sets, a novel preprocessing technique for Maximum k-Cut, and extends existing techniques from Maximum Cut. The rules are optimality-preserving and yield significan…

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper presents a local computation algorithm to approximate the top eigenvector of a symmetric matrix with entries between -1 and 1, building on Swartworth and Woodruff's work.

The paper provides constant-factor approximation algorithms for Max Dist-2 Independent Set and Min Dominating Set in graphs of bounded radius-2 merge-width.

This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…