Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods

We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number ρ like interval and disk graphs with applications to, e.g., task scheduling, spectrum allocation and admission control. In the online setting, nodes of an unknown graph arrive one by one over time. An online algorithm has to decide whether an arriving node should be included into the independent set.

[1]  Berthold Vöcking,et al.  An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions , 2013, ESA.

[2]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.

[3]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[4]  Mohammad Taghi Hajiaghayi,et al.  Online prophet-inequality matching with applications to ad allocation , 2012, EC '12.

[5]  Nikhil R. Devanur,et al.  Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.

[6]  Sourav Chakraborty,et al.  Improved competitive ratio for the matroid secretary problem , 2012, SODA.

[7]  Saeed Alaei,et al.  Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[8]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[9]  Martin Pál,et al.  Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.

[10]  Jon Feldman,et al.  Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.

[11]  Akcoglu Karhan,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000 .

[12]  Karhan Akcoglu,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000, ArXiv.

[13]  Michael Dinitz,et al.  Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory , 2009, IEEE INFOCOM 2009.

[14]  Martin Hoefer,et al.  Online capacity maximization in wireless networks , 2013, J. Sched..

[15]  Nicole Immorlica,et al.  A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.

[16]  Sandy Irani,et al.  Coloring inductive graphs on-line , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  Zizhuo Wang,et al.  A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..

[18]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[19]  Berthold Vöcking,et al.  Primal beats dual on online packing LPs in the random-order model , 2013, STOC.

[20]  Berthold Vöcking,et al.  Online Mechanism Design (Randomized Rounding on the Fly) , 2012, ICALP.

[21]  Shuchi Chawla,et al.  Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.

[22]  Magnús M. Halldórsson,et al.  Wireless capacity with oblivious power in general metrics , 2011, SODA '11.

[23]  Martin Hoefer,et al.  Universally truthful secondary spectrum auctions , 2013, SPAA.

[24]  U. Krengel,et al.  Semiamarts and finite values , 1977 .

[25]  Mohammad Taghi Hajiaghayi,et al.  Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.

[26]  Thomas Kesselheim,et al.  A constant-factor approximation for wireless capacity maximization with power control in the SINR model , 2010, SODA '11.

[27]  Sandy Irani.  Coloring inductive graphs on-line , 2005, Algorithmica.

[28]  Roger Wattenhofer,et al.  The Power of Non-Uniform Wireless Power , 2013, SODA.

[29]  S. Matthew Weinberg,et al.  Matroid prophet inequalities , 2012, STOC '12.

[30]  Allan Borodin,et al.  Elimination Graphs , 2009, ICALP.

[31]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[32]  Roger Wattenhofer,et al.  Computing Wireless Capacity∗ , 2010 .

[33]  Klaus Jansen,et al.  Polynomial-Time Approximation Schemes for Geometric Intersection Graphs , 2005, SIAM J. Comput..

[34]  R. Ravi,et al.  Geometry of Online Packing Linear Programs , 2012, ICALP.

[35]  Roger Wattenhofer,et al.  Capacity of Arbitrary Wireless Networks , 2009, IEEE INFOCOM 2009.