Stochastic Weighted Matching: (1-ε) Approximation

04/18/2020
by   Soheil Behnezhad, et al.
0

Let G=(V, E) be a given edge-weighted graph and let its realizationG be a random subgraph of G that includes each edge e ∈ E independently with probability p. In the stochastic matching problem, the goal is to pick a sparse subgraph Q of G without knowing the realization G, such that the maximum weight matching among the realized edges of Q (i.e. graph Q ∩G) in expectation approximates the maximum weight matching of the whole realization G. In this paper, we prove that for any desirably small ϵ∈ (0, 1), every graph G has a subgraph Q that guarantees a (1-ϵ)-approximation and has maximum degree only O_ϵ, p(1). That is, the maximum degree of Q depends only on ϵ and p (both of which are known to be necessary) and not for example on the number of nodes in G, the edge-weights, etc. The stochastic matching problem has been studied extensively on both weighted and unweighted graphs. Previously, only existence of (close to) half-approximate subgraphs was known for weighted graphs [Yamaguchi and Maehara, SODA'18; Behnezhad et al., SODA'19]. Our result substantially improves over these works, matches the state-of-the-art for unweighted graphs [Behnezhad et al., STOC'20], and essentially settles the approximation factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

Stochastic Matching with Few Queries: New Algorithms and Tools

We consider the following stochastic matching problem on both weighted a...
research
07/08/2022

Maximum Weight b-Matchings in Random-Order Streams

We consider the maximum weight b-matching problem in the random-order se...
research
02/27/2020

Stochastic Matching with Few Queries: (1-ε) Approximation

Suppose that we are given an arbitrary graph G=(V, E) and know that each...
research
10/03/2017

Maximum Matchings in Graphs for Allocating Kidney Paired Donation

Relatives and friends of an end-stage renal disease patient who offer to...
research
03/16/2023

Optimal Intervention on Weighted Networks via Edge Centrality

Suppose there is a spreading process such as an infectious disease propa...
research
05/29/2022

Generalized Stochastic Matching

In this paper, we generalize the recently studied Stochastic Matching pr...
research
12/10/2021

Stochastic Vertex Cover with Few Queries

We study the minimum vertex cover problem in the following stochastic se...

Please sign up or login with your details

Forgot password? Click here to reset