Document

# When the Optimum is also Blind: a New Perspective on Universal Optimization

## File

LIPIcs.ICALP.2017.35.pdf
• Filesize: 0.56 MB
• 15 pages

## Cite As

Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, and Michal Wlodarczyk. When the Optimum is also Blind: a New Perspective on Universal Optimization. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 35:1-35:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.ICALP.2017.35

## Abstract

Consider the following variant of the set cover problem. We are given a universe U={1,...,n} and a collection of subsets C = {S_1,...,S_m} where each S_i is a subset of U. For every element u from U we need to find a set phi(u) from collection C such that u belongs to phi(u). Once we construct and fix the mapping phi from U to C a subset X from the universe U is revealed, and we need to cover all elements from X with exactly phi(X), that is {phi(u)}_{all u from X}. The goal is to find a mapping such that the cover phi(X) is as cheap as possible. This is an example of a universal problem where the solution has to be created before the actual instance to deal with is revealed. Such problems appear naturally in some settings when we need to optimize under uncertainty and it may be actually too expensive to begin finding a good solution once the input starts being revealed. A rich body of work was devoted to investigate such problems under the regime of worst case analysis, i.e., when we measure how good the solution is by looking at the worst-case ratio: universal solution for a given instance vs optimum solution for the same instance. As the universal solution is significantly more constrained, it is typical that such a worst-case ratio is actually quite big. One way to give a viewpoint on the problem that would be less vulnerable to such extreme worst-cases is to assume that the instance, for which we will have to create a solution, will be drawn randomly from some probability distribution. In this case one wants to minimize the expected value of the ratio: universal solution vs optimum solution. Here the bounds obtained are indeed smaller than when we compare to the worst-case ratio. But even in this case we still compare apples to oranges as no universal solution is able to construct the optimum solution for every possible instance. What if we would compare our approximate universal solution against an optimal universal solution that obeys the same rules as we do? We show that under this viewpoint, but still in the stochastic variant, we can indeed obtain better bounds than in the expected ratio model. For example, for the set cover problem we obtain \$H_n\$ approximation which matches the approximation ratio from the classic deterministic setup. Moreover, we show this for all possible probability distributions over \$U\$ that have a polynomially large carrier, while all previous results pertained to a model in which elements were sampled independently. Our result is based on rounding a proper configuration IP that captures the optimal universal solution, and using tools from submodular optimization. The same basic approach leads to improved approximation algorithms for other related problems, including Vertex Cover, Edge Cover, Directed Steiner Tree, Multicut, and Facility Location.
##### Keywords
• approximation algorithms
• stochastic optimization
• submodularity

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Susanne Albers and Stefano Leonardi. On-line algorithms. ACM Comput. Surv., 31(3es):4, 1999.
2. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. The Online Set Cover Problem. In STOC'03, pages 100-105, 2003.
3. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, and Joseph (Seffi) Naor. A general approach to online network optimization problems. In SODA'04, pages 577-586, 2004.
4. Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, and Piotr Sankowski. Online network design with outliers. Algorithmica, 76(1):88-109, 2016.
5. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. Optimal oblivious routing in polynomial time. In STOC'03, pages 383-388, 2003.
6. Dimitris Bertsimas and Michelangelo Grigni. Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem. Oper. Res. Lett., 8(5):241-244, 1989.
7. Dimitris J. Bertsimas, Patrick Jaillet, and Amedeo R. Odoni. A priori optimization. Oper. Res., 38(6):1019-1033, 1990.
8. Marcin Bienkowski, Miroslaw Korzeniowski, and Harald Räcke. A practical algorithm for constructing oblivious routing schemes. In SPAA'03, pages 24-33, 2003.
9. Allan Borodin and Ran El-Yaniv. Online computation and competitive analysis. Cambridge University Press, New York, 1998.
10. Niv Buchbinder and Joseph Naor. Online primal-dual algorithms for covering and packing problems. In ESA'05, pages 689-701, 2005.
11. Moses Charikar, Chandra Chekuri, and Martin Pál. Sampling bounds for stochastic optimization. In Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pages 257-269, 2005. URL: http://dx.doi.org/10.1007/11538462_22.
12. Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, and Atri Rudra. Approximating matches made in heaven. In Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pages 266-278, 2009. URL: http://dx.doi.org/10.1007/978-3-642-02927-1_23.
13. Brian C. Dean, Michel X. Goemans, and Jan Vondrák. Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res., 33(4):945-964, 2008. URL: http://dx.doi.org/10.1287/moor.1080.0330.
14. Reza Dorrigiv and Alejandro Lopez-Ortiz. A survey of performance measures for on-line algorithms. SIGACT News, 36(3):67-81, 2005.
15. Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, and Anke van Zuylen. Scheduling over scenarios on two machines. In Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, pages 559-571, 2014. URL: http://dx.doi.org/10.1007/978-3-319-08783-2_48.
16. Amos Fiat and Gerhard J. Woeginger, editors. Online algorithms, volume 1442 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
17. Dimitris Fotakis. On the competitive ratio for online facility location. In ICALP'03, pages 637-652. Springer, 2003.
18. P. R. Freeman. The secretary problem and its extensions: a review. Internat. Statist. Rev., 51(2):189-206, 1983.
19. Naveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski. Stochastic analyses for online combinatorial optimization problems. In SODA'08, pages 942-951, 2008.
20. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, and Mohit Singh. Set covering with our eyes closed. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pages 347-356, 2008. URL: http://dx.doi.org/10.1109/FOCS.2008.31.
21. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, and Mohit Singh. Set covering with our eyes closed. SIAM J. Comput., 42(3):808-830, 2013.
22. Anupam Gupta, Mohammad Taghi Hajiaghayi, and Harald Räcke. Oblivious network design. In SODA'06, pages 970-979, 2006.
23. Anupam Gupta and Viswanath Nagarajan. A stochastic probing problem with applications. In Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings, pages 205-216, 2013. URL: http://dx.doi.org/10.1007/978-3-642-36694-9_18.
24. Mohammad T. Hajiaghayi, Robert D. Kleinberg, Tom Leighton, and Harald Räcke. Oblivious routing on node-capacitated and directed graphs. In SODA'05, pages 782-790, 2005.
25. Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, and Harald Räcke. Oblivious routing in directed graphs with random demands. In STOC'05, pages 193-201, 2005.
26. Mohammad Taghi Hajiaghayi, Robert Kleinberg, and David C. Parkes. Adaptive limited-supply online auctions. In EC'04, pages 71-80, 2004.
27. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and Frank Thomson Leighton. Improved lower and upper bounds for universal tsp in planar metrics. In SODA'06, pages 649-658, 2006.
28. Chris Harrelson, Kirsten Hildrum, and Satish Rao. A polynomial-time tree decomposition to minimize congestion. In SPAA'03, pages 34-43, 2003.
29. Nicole Immorlica, David Karger, Maria Minkoff, and Vahab Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In SODA'04, pages 684-693, 2004.
30. Satoru Iwata, Lisa Fleischer, and Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM), 48(4):761-777, 2001.
31. Patrick Jaillet. A priori solution of a travelling salesman problem in which a random subset of the customers are visited. Oper. Res., 36(6):929-936, 1988.
32. Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, and Ravi Sundaram. Universal approximations for tsp, steiner tree, and set cover. In STOC'05, pages 386-395, 2005.
33. David R. Karger and Maria Minkoff. Building Steiner trees with incomplete global knowledge. In FOCS'00, pages 613-623, 2000.
34. Simon Korman. On the use of randomization in the online set cover problem, 2004. MSc Thesis.
35. Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. AdWords and generalized online matching. J. ACM, 54(5):Art. 22, 19 pp., 2007.
36. Adam Meyerson. Online facility location. In FOCS'01, pages 426-431. IEEE Computer Society, 2001.
37. Adam Meyerson, Kamesh Munagala, and Serge Plotkin. Designing networks incrementally. In FOCS'01, pages 406-415, 2001.
38. Rolf H. Möhring, Andreas S. Schulz, and Marc Uetz. Approximation in stochastic scheduling: the power of lp-based priority policies. J. ACM, 46(6):924-942, 1999. URL: http://dx.doi.org/10.1145/331524.331530.
39. Loren K. Platzman and John J. Bartholdi, III. Spacefilling curves and the planar travelling salesman problem. J. ACM, 36(4):719-737, 1989.
40. Harald Räcke. Minimizing congestion in general networks. In FOCS'02, pages 43-52, 2002.
41. Harald Räcke. Optimal Hierarchical Decompositions for Congestion Minimization in Networks. In STOC'08, 2008.
42. R. Ravi and Amitabh Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In IPCO'04, pages 101-115, 2004.
43. Frans Schalekamp and David B. Shmoys. Algorithms for the universal and a priori tsp. Oper. Res. Lett., 36(1):1-3, Jan 2008.
44. David B. Shmoys and Chaitanya Swamy. An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM, 53(6):978-1012, 2006.
45. David B. Shmoys and Kunal Talwar. A constant approximation algorithm for the a priori traveling salesman problem. In IPCO'08, 2008.
46. Aravind Srinivasan. Approximation algorithms for stochastic and risk-averse optimization. In SODA'07, pages 1305-1313, 2007.
47. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In STOC'81, pages 263-277, 1981.
48. Martijn van Ee, Leo van Iersel, Teun Janssen, and René Sitters. A priori TSP in the scenario model. In Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers, pages 183-196, 2016. URL: http://dx.doi.org/10.1007/978-3-319-51741-4_15.
49. Berthold Vöcking. Almost optimal permutation routing on hypercubes. In STOC'01, pages 530-539, 2001.
50. Jan Vondrák. Submodularity in combinatorial optimization. PhD thesis, Charles University, 2007.
X

Feedback for Dagstuhl Publishing