Stochastic Packing Integer Programs with Few Queries

@inproceedings{Yamaguchi2018StochasticPI,
  title={Stochastic Packing Integer Programs with Few Queries},
  author={Yutaro Yamaguchi and Takanori Maehara},
  booktitle={SODA},
  year={2018}
}
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… Expand
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. Expand
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. Expand
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
TLDR
This work proposes and study 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, and gives a 2-round-competitive algorithm for determining the i-th smallest value and identifying all elements with that value in a set of uncertain elements. Expand
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. Expand
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. Expand
The Stochastic Matching Problem with (Very) Few Queries
TLDR
The adaptive and non-adaptive algorithms achieve the same approximation factor as the previous best algorithms of Blum et al. (EC 2015) for this problem, while requiring an exponentially smaller number of per-vertex queries (and rounds of adaptive queries for the adaptive algorithm). Expand
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). Expand
Stochastic Monotone Submodular Maximization with Queries
TLDR
It is proved that the problem admits a good query strategy if the feasible domain has a uniform exchange property, and generalizes Blum et al.'s result on the unweighted matching problem and Behnezhad and Reyhani's results on the weighted matching problem in both objective function and feasible domain. Expand
Stochastic Matching with Few Queries: New Algorithms and Tools
TLDR
This work considers the following stochastic matching problem on both weighted and unweighted graphs, and introduces a number of procedures that construct heavy fractional matchings and achieves the first algorithm to break the 0.5 approximation barrier for weighted graphs. Expand
Stochastic Weighted Matching: $(1-ε)$ Approximation
TLDR
This paper proves that for any ε ∈ (0, 1), every graph G has a subgraph Q that has maximum degree only Oε,p(1) and guarantees a (1− ε)-approximation, which substantially improves over previous works, matches the state of the art for unweighted graphs, and settles the approximation factor. Expand
...
1
2
...

References

SHOWING 1-10 OF 41 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. Expand
Adaptivity and approximation for stochastic packing problems
TLDR
The adaptivity gap is investigated for these problems: the maximum ratio between the expected values achieved by optimal adaptive and non-adaptive policies, and the hardness results for deterministic PIP are improved. Expand
Iterative Packing for Demand and Hypergraph Matching
TLDR
A simple iterative packing technique that retains features of Jain's seminal approach, including the property that the magnitude of the fractional value of the element rounded during each iteration has a direct impact on the approximation guarantee. Expand
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. Expand
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. Expand
The Demand Matching Problem
TLDR
A fully polynomial approximation scheme is presented for the well-known b-matching problem in the presence of integer demands on the edges, thus generalizing a well- known result for the knapsack problem. Expand
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. Expand
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. Expand
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). Expand
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. Expand
...
1
2
3
4
5
...