
Breaking O(nr) for Matroid Intersection
We present algorithms that break the Õ(nr)independencequery bound for ...
read it

Faster Matroid Intersection
In this paper we consider the classic matroid intersection problem: give...
read it

A note on Cunningham's algorithm for matroid intersection
In the matroid intersection problem, we are given two matroids of rank r...
read it

Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme
Vertex connectivity a classic extensivelystudied problem. Given an inte...
read it

Breaking the 3/2 barrier for unit distances in three dimensions
We prove that every set of n points in R^3 spans O(n^295/197+ϵ) unit dis...
read it

Stochastic Matching with Few Queries: New Algorithms and Tools
We consider the following stochastic matching problem on both weighted a...
read it

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
We present a computationallyefficient truthful mechanism for combinator...
read it
Breaking the Quadratic Barrier for Matroid Intersection
The matroid intersection problem is a fundamental problem that has been extensively studied for half a century. In the classic version of this problem, we are given two matroids ℳ_1 = (V, ℐ_1) and ℳ_2 = (V, ℐ_2) on a comment ground set V of n elements, and then we have to find the largest common independent set S ∈ℐ_1 ∩ℐ_2 by making independence oracle queries of the form "Is S ∈ℐ_1?" or "Is S ∈ℐ_2?" for S ⊆ V. The goal is to minimize the number of queries. Beating the existing Õ(n^2) bound, known as the quadratic barrier, is an open problem that captures the limits of techniques from two lines of work. The first one is the classic Cunningham's algorithm [SICOMP 1986], whose Õ(n^2)query implementations were shown by CLS+ [FOCS 2019] and Nguyen [2019]. The other one is the general cutting plane method of Lee, Sidford, and Wong [FOCS 2015]. The only progress towards breaking the quadratic barrier requires either approximation algorithms or a more powerful rank oracle query [CLS+ FOCS 2019]. No exact algorithm with o(n^2) independence queries was known. In this work, we break the quadratic barrier with a randomized algorithm guaranteeing Õ(n^9/5) independence queries with high probability, and a deterministic algorithm guaranteeing Õ(n^11/6) independence queries. Our key insight is simple and fast algorithms to solve a graph reachability problem that arose in the standard augmenting path framework [Edmonds 1968]. Combining this with previous exact and approximation algorithms leads to our results.
READ FULL TEXT
Comments
There are no comments yet.