
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries
The problem of sparsifying a graph or a hypergraph while approximately p...
read it

Nearlinear Size Hypergraph Cut Sparsifiers
Cuts in graphs are a fundamental object of study, and play a central rol...
read it

Graph Connectivity and Single Element Recovery via Linear and OR Queries
We study the problem of finding a spanning forest in an undirected, nve...
read it

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs
We give the first polynomialtime approximation scheme (PTAS) for the st...
read it

Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation
We consider the problem of designing sublinear time algorithms for estim...
read it

NearPerfect Recovery in the OneDimensional Latent Space Model
Suppose a graph G is stochastically created by uniformly sampling vertic...
read it

Network Formation under Random Attack and Probabilistic Spread
We study a network formation game where agents receive benefits by formi...
read it

A New Algorithm for Decremental SingleSource Shortest Paths with Applications to VertexCapacitated Flow and Cut Problems
We study the vertexdecremental SingleSource Shortest Paths (SSSP) prob...
read it

Polynomial Pass Lower Bounds for Graph Streaming Algorithms
We present new lower bounds that show that a polynomial number of passes...
read it

A Simple SublinearTime Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
In the subgraph counting problem, we are given a input graph G(V, E) and...
read it

Stochastic Submodular Cover with Limited Adaptivity
In the submodular cover problem, we are given a nonnegative monotone su...
read it

Testing Graph Clusterability: Algorithms and Lower Bounds
We consider the problem of testing graph cluster structure: given access...
read it

Sublinear Algorithms for (Δ+ 1) Vertex Coloring
Any graph with maximum degree Δ admits a proper vertex coloring with Δ +...
read it

Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem
We study the maximum kset coverage problem in the following distributed...
read it

Better and Simpler Error Analysis of the SinkhornKnopp Algorithm for Matrix Scaling
Given a nonnegative n × m real matrix A, the matrix scaling problem is...
read it
Sanjeev Khanna
is this you? claim profile