1.5k citations
- Massachusetts Institute of TechnologyUS194 papers
- Centre National de la Recherche ScientifiqueFR33 papers
- Harvard UniversityUS29 papers
- University of California, BerkeleyUS24 papers
- California Institute of TechnologyUS22 papers
- Northeastern UniversityUS22 papers
- University of CambridgeGB18 papers
- Cornell UniversityUS17 papers
- Kavli Institute for Particle Astrophysics and CosmologyUS17 papers
- Princeton UniversityUS17 papers
- MIT Computer Science and Artificial Intelligence LaboratoryUS16 papers
- Sorbonne UniversitéFR16 papers
23 papers · 1 filter
Tight Approximation Results for Matroid Optimization with a Linear Constraint
Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler
We study the following class of matroid optimization problems with a linear constraint (P-MOL). Given a matroid M=(E,I), two weight functions , and a threshold…
Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
Mohsen Ghaffari, Jaehyun Koo
This paper presents the first parallel batch-dynamic algorithms for computing spanners and sparsifiers. Our algorithms process any batch of edge insertions and deletions in an -…
Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
Mohsen Ghaffari, Jaehyun Koo
We present the first parallel batch-dynamic algorithm for approximating coreness decomposition with worst-case update times. Given any batch of edge insertions and deletions, our a…
An Enumerative Perspective on Connectivity
Shyan Akmal
Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph with vertices and , the con…
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
Ofer Grossman, Meghal Gupta, Mark Sellke
We investigate one of the most basic problems in streaming algorithms: approximating the number of elements in the stream. In 1978, Morris famously gave a randomized algorithm achi…
Sampling from convex sets with a cold start using multiscale decompositions
Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava
Running a random walk in a convex body is a standard approach to sample approximately uniformly from the body. The requirement is that from a suitable init…