Orienting (hyper)graphs under explorable stochastic uncertainty

Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node with minimum weight can be determined for each hyperedge. Querying a node has a cost and reveals the precise weight of the node, drawn from the given probability distribution. Using competitive analysis, we compare the expected query cost of an algorithm with the expected cost of an optimal query set for the given instance. For the general case, we give a polynomial-time f(α)-competitive algorithm, where f(α) ∈ [1.618+e,2] depends on the approximation ratio α for an underlying vertex cover problem. We also show that no algorithm using a similar approach can be better than 1.5-competitive. Furthermore, we give polynomial-time 4/3-competitive algorithms for bipartite graphs with arbitrary query costs and for hypergraphs with a single hyperedge and uniform query costs, with matching lower bounds.

[1]  Evripidis Bampis,et al.  Scheduling under Uncertainty: A Query-based Approach , 2018, IJCAI.

[2]  Haotian Jiang,et al.  The Markovian Price of Information , 2019, IPCO.

[3]  Anupam Gupta,et al.  A Stochastic Probing Problem with Applications , 2013, IPCO.

[4]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[5]  Cyrus Rashtchian,et al.  Edge Estimation with Independent Set Oracles , 2017, ITCS.

[6]  Jennifer Widom,et al.  Computing the median with uncertainty , 2000, STOC '00.

[7]  José A. Soto,et al.  The minimum cost query problem on matroids with uncertainty areas , 2019, ICALP.

[8]  Anita Schöbel,et al.  The robust knapsack problem with queries , 2015, Comput. Oper. Res..

[9]  Miroslav Chlebík,et al.  The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes , 2007, SIAM J. Discret. Math..

[10]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[11]  M. Weitzman.  Optimal search for the best alternative , 1978 .

[12]  Rajeev Motwani,et al.  Computing shortest paths with uncertainty , 2003, J. Algorithms.

[13]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Mohammad Taghi Hajiaghayi,et al.  Stochastic Matching with Few Queries: New Algorithms and Tools , 2019, SODA.

[15]  S. Albers,et al.  Explorable Uncertainty in Scheduling with Non-Uniform Testing Times , 2020, WAOA.

[16]  Thomas Erlebach,et al.  Minimum Spanning Tree Verification Under Uncertainty , 2014, WG.

[17]  Simon Kahan,et al.  A model for data in motion , 1991, STOC '91.

[18]  S. Matthew Weinberg,et al.  Computing Exact Minimum Cuts Without Knowing the Graph , 2017, ITCS.

[19]  Sahil Singla,et al.  The Price of Information in Combinatorial Optimization , 2017, SODA.

[20]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[21]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[22]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[23]  Nicole Megow,et al.  Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments , 2017, SEA.

[24]  Atri Rudra,et al.  Approximating Matches Made in Heaven , 2009, ICALP.

[25]  Thomas L. Magnanti,et al.  Scheduling with Testing , 2019, Manag. Sci..

[26]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[27]  Martin Skutella,et al.  Randomization Helps Computing a Minimum Spanning Tree under Uncertainty , 2017, SIAM J. Comput..

[28]  Dror Rawitz,et al.  Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004 , 2004, CSUR.

[29]  Yogish Sabharwal,et al.  The update complexity of selection and related problems , 2011, FSTTCS.

[30]  Oded Goldreich,et al.  Introduction to Property Testing , 2017 .

[31]  Jennifer Widom,et al.  Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.

[32]  Thomas Erlebach,et al.  Computing Minimum Spanning Trees with Uncertainty , 2008, STACS.

[33]  R. Ravi,et al.  Running Errands in Time: Approximation Algorithms for Stochastic Orienteering , 2015, Math. Oper. Res..

[34]  Thomas Erlebach,et al.  An Adversarial Model for Scheduling with Testing , 2017, Algorithmica.

[35]  M. Halldórsson,et al.  Query Minimization under Stochastic Uncertainty , 2020, LATIN.

[36]  Anupam Gupta,et al.  Algorithms and Adaptivity Gaps for Stochastic Probing , 2016, SODA.

[37]  Noam Nisan,et al.  The Demand Query Model for Bipartite Matching , 2019, SODA.

[38]  Atri Rudra,et al.  When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings , 2010, Algorithmica.

[39]  Sanjeev Khanna,et al.  On computing functions with uncertainty , 2001, PODS '01.

[40]  Sepehr Assadi,et al.  Graph Connectivity and Single Element Recovery via Linear and OR Queries , 2020, ESA.

[41]  Maxim Sviridenko,et al.  Submodular Stochastic Probing on Matroids , 2013, Math. Oper. Res..

[42]  Nikhil Bansal,et al.  On the adaptivity gap of stochastic orienteering , 2013, Mathematical Programming.

[43]  W. R. Thompson.  ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .

[44]  Thomas Erlebach,et al.  Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries , 2021, ArXiv.

[45]  Rajeev Raman,et al.  Efficient Update Strategies for Geometric Computing with Uncertainty , 2003, CIAC.

[46]  Thomas Erlebach,et al.  Untrusted Predictions Improve Trustable Query Policies , 2020, ArXiv.

[47]  Ariel D. Procaccia,et al.  Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries , 2014, EC.

[48]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[49]  Yogish Sabharwal,et al.  The Update Complexity of Selection and Related Problems , 2015, Theory of Computing Systems.

[50]  Hanna Mazzawi,et al.  Optimally reconstructing weighted graphs using queries , 2010, SODA '10.

[51]  Reuven Bar-Yehuda,et al.  On approximating a vertex cover for planar graphs , 1982, STOC '82.

[52]  H. Robbins.  A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .

[53]  Magnús M. Halldórsson,et al.  Query-Competitive Sorting with Uncertainty , 2020, MFCS.

[54]  Yang Li,et al.  The Stochastic Matching Problem with (Very) Few Queries , 2016, EC.

[55]  Will Ma,et al.  Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms , 2018, Math. Oper. Res..

[56]  Xi Chen,et al.  Nearly optimal edge estimation with independent set queries , 2020, SODA.