Stochastic packing integer programs with few queries

@article{Yamaguchi2018StochasticPI,
  title={Stochastic packing integer programs with few queries},
  author={Yutaro Yamaguchi and Takanori Maehara},
  journal={Mathematical Programming},
  year={2018},
  volume={182},
  pages={141-174}
}
We consider a stochastic variant of the packing-type integer linear programming problem, which contains random variables in the objective vector. We are allowed to reveal each entry of the objective vector by conducting a query, and the task is to find a good solution by conducting a small number of queries. We propose a general framework of adaptive and non-adaptive algorithms for this problem, and provide a unified methodology for analyzing the performance of those algorithms. We also… 

Tables from this paper

Query-Competitive Sorting with Uncertainty

TLDR
It is shown that an offline optimum query set can be found in polynomial time, and that both oblivious and adaptive problems have simple query-competitive algorithms.

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

TLDR
A new model where k queries can be made in parallel in each round, and the goal is to minimize the number of query rounds is introduced, which includes 2-round-competitive algorithms for sorting and selection.

Improved Approximation Algorithms for Stochastic-Matching Problems

TLDR
A novel way of probing edges according to a not-uniformly-random permutation is proposed, which Patching this method with an algorithm that works best for large-probability edges (plus additional ideas) leads to improved approximation factors.

Stochastic matching with few queries: (1-ε) approximation

TLDR
An algorithm that constructs a matching on a stochastic graph, which among some other important properties, guarantees that each vertex is matched independently from the vertices that are sufficiently far is analyzed and bypassed a previously known barrier towards achieving (1−є) approximation based on existence of dense Ruzsa-Szemerédi graphs.

Beating Greedy for Stochastic Bipartite Matching

TLDR
A linear program (LP) is used to upper bound the optimum achieved by any strategy in the maximum bipartite matching problem in stochastic settings, namely the query-commit and price-of-information models.

Almost Optimal Stochastic Weighted Matching with Few Queries

TLDR
An adaptive algorithm that for any arbitrarily small ε > 0, finds a (1-ε)-approximation in expectation, by querying only O(1) edges per vertex by introducing novel properties of a generalization of augmenting paths to weighted matchings that may be of independent interest.

Stochastic Minimum Vertex Cover in General Graphs: a 3 / 2-Approximation

TLDR
This work designs an algorithm that returns a vertex cover of G ⋆ with size at most (3 / 2+ ε ) times the expected size of the minimum vertex cover, using only O ( n/εp ) non-adaptive queries, which improves over the best-known 2-approximation algorithm by Behnezhad, Blum and Derakhshan.

The Stochastic Matching Problem with (Very) Few Queries

TLDR
The adaptive and non-adaptive algorithms achieve the same approximation factor a the previous best algorithms of Blum etal (EC 2015) for this problem, while requiring exponentially smaller number of per-vertex queries (and rounds of adaptive queries for the adaptive algorithm).

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark

TLDR
This paper is the first to consider the online benchmark for the edge arrival version of the max-weight stochastic matchings on online bipartite graphs under both vertex and edge arrivals and designs a simple algorithm with a significantly improved approximation ratio of (1-1/e).

References

SHOWING 1-10 OF 47 REFERENCES

Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries

TLDR
It is shown on both generated data and on real data from the first 169 match runs of the UNOS nationwide kidney exchange that even a very small number of non-adaptive edge queries per vertex results in large gains in expected successful matches.

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

TLDR
A randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0–1 problem is given and can be extended to provide bounds on the disparity between the rational and 0-1 optima for a given problem instance.

Stochastic Matching with Commitment

TLDR
This work considers the following stochastic optimization problem first introduced by Chen et al. in [7], given a vertex set of a random graph where each possible edge is present with probability pe and presents a 0.573 factor algorithm using a novel sampling technique.

On linear and semidefinite programming relaxations for hypergraph matching

TLDR
This paper analyzes different linear and semidefinite programming relaxations for the hypergraph matching problem, and proves that the Lovász -function provides an SDP relaxation with integrality gap at most, and gives an indirect way to bound the ratio between any local optimal solution and any optimal SDP solution.

Almost Optimal Stochastic Weighted Matching with Few Queries

TLDR
An adaptive algorithm that for any arbitrarily small ε > 0, finds a (1-ε)-approximation in expectation, by querying only O(1) edges per vertex by introducing novel properties of a generalization of augmenting paths to weighted matchings that may be of independent interest.

The Demand-Matching Problem

TLDR
This work examines formulations for the well-known b-matching problem in the presence of integer demands on the edges and describes a 3-approximation algorithm for the cardinality version of the problem.

The Stochastic Matching Problem with (Very) Few Queries

TLDR
The adaptive and non-adaptive algorithms achieve the same approximation factor a the previous best algorithms of Blum etal (EC 2015) for this problem, while requiring exponentially smaller number of per-vertex queries (and rounds of adaptive queries for the adaptive algorithm).

Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds

TLDR
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced.

A Stochastic Probing Problem with Applications

TLDR
The first polynomial-time Ω(1/k)-approximate "Sequential Posted Price Mechanism" under k-matroid intersection feasibility constraints is obtained, improving on prior work.

The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm

TLDR
This work presents the first algorithm for stochastic matching with an approximation guarantee that is strictly better than 1/2: the algorithm computes a subgraph H of G with the maximum degree O(log(1/p)/p such that the ratio of expected size of a maximum matching in realizations of H and G is at least 1/ 2 + δ0 for some absolute constant δ 0 > 0.