The Demand Query Model for Bipartite Matching

06/10/2019
by   Noam Nisan, et al.
0

We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching seem to be translatable into this model including exact, approximate, sequential, parallel, and online ones. A perfect matching in a bipartite graph can be found in this model with O(n^3/2) demand queries (in a bipartite graph with n vertices on each side) and our main open problem is to either improve the upper bound or prove a lower bound. An improved upper bound could yield "normal" algorithms whose running time is better than the fastest ones known, while a lower bound would rule out a faster algorithm for bipartite matching from within a large class of algorithms. Our main result is a lower bound for finding an approximately maximum size matching in parallel: A deterministic algorithm that runs in n^o(1) rounds, where each round can make at most n^1.99 demand queries cannot find a matching whose size is within n^o(1) factor of the maximum. This is in contrast to randomized algorithms that can find a matching whose size is 99% of the maximum in O(log n) rounds, each making n demand queries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2020

The Dual Polynomial of Bipartite Perfect Matching

We obtain a description of the Boolean dual function of the Bipartite Pe...
research
11/19/2020

Approximate Bipartite Vertex Cover in the CONGEST Model

We give efficient distributed algorithms for the minimum vertex cover pr...
research
02/18/2020

The Complexity of Interactively Learning a Stable Matching by Trial and Error

In a stable matching setting, we consider a query model that allows for ...
research
04/25/2021

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

For a graph G=(V,E), finding a set of disjoint edges that do not share a...
research
09/18/2023

Maintaining Matroid Intersections Online

Maintaining a maximum bipartite matching online while minimizing recours...
research
10/13/2022

The Power of Multi-Step Vizing Chains

Recent papers [Ber'2022], [GP'2020], [DHZ'2019] have addressed different...
research
09/08/2018

Multitasking Capacity: Hardness Results and Improved Constructions

We consider the problem of determining the maximal α∈ (0,1] such that ev...

Please sign up or login with your details

Forgot password? Click here to reset