Cited By
View all- Wang YFabbri FMathioudakis M(2021)Fair and Representative Subset Selection from Data StreamsProceedings of the Web Conference 202110.1145/3442381.3449799(1340-1350)Online publication date: 19-Apr-2021
Online submodular maximization with free disposal: randomization beats 1/4 for partition matroids
Authors: 
T-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin TangAuthors Info & Claims
T-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin TangAuthors Info & ClaimsPages 1204 - 1223
Abstract
We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In each round when a new element arrives, the algorithm may accept the new element into its feasible set and possibly remove elements from it, provided that the resulting set is still independent. The goal is to maximize the value of the final feasible set under some monotone submodular function, to which the algorithm has oracle access.
For k-uniform matroids, we give a deterministic algorithm with competitive ratio at least 0.2959, and the ratio approaches 1/α∞ ≈ 0.3178 as k approaches infinity, improving the previous best ratio of 0.25 by Chakrabarti and Kale (IPCO 2014), Buchbinder et al. (SODA 2015) and Chekuri et al. (ICALP 2015). We also show that our algorithm is optimal among a class of deterministic monotone algorithms that accept a new arriving element only if the objective is strictly increased.
Further, we prove that no deterministic monotone algorithm can be strictly better than 0.25-competitive even for partition matroids, the most modest generalization of k-uniform matroids, matching the competitive ratio by Chakrabarti and Kale (IPCO 2014) and Chekuri et al. (ICALP 2015). Interestingly, we show that randomized algorithms are strictly more powerful by giving a (non-monotone) randomized algorithm for partition matroids with ratio 1/α∞ ≈ 0.3178.
Finally, our techniques can be extended to a more general problem that generalizes both the online sub-modular maximization problem and the online bipartite matching problem with free disposal. Using the techniques developed in this paper, we give constant-competitive algorithms for the submodular online bipartite matching problem.
References
[1]
Alexander A. Ageev and Maxim Sviridenko. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim., 8(3):307--328, 2004.
[2]
Gagan Aggarwal, Gagan Goel, Chinmay Karande, and Aranyak Mehta. Online vertex-weighted bipartite matching and single-bid budgeted allocations. In SODA, pages 1253--1264, 2011.
[3]
BV Ashwinkumar and Robert Kleinberg. Randomized online algorithms for the buyback problem. In International Workshop on Internet and Network Economics, pages 529--536. Springer, 2009.
[4]
Moshe Babaioff, Jason Hartline, and Robert Kleinberg. Selling banner ads: Online algorithms with buyback. In Fourth Workshop on Ad Auctions, 2008.
[5]
Moshe Babaioff, Jason D Hartline, and Robert D Kleinberg. Selling ad campaigns: online algorithms with cancellations. In Proceedings of the 10th ACM conference on Electronic commerce, pages 61--70. ACM, 2009.
[6]
Siddharth Barman, Seeun Umboh, Shuchi Chawla, and David L. Malec. Secretary problems with convex costs. In ICALP (1), volume 7391 of Lecture Notes in Computer Science, pages 75--87. Springer, 2012.
[7]
Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, and Morteza Zadimoghaddam. Submodular secretary problem and extensions. ACM Transactions on Algorithms, 9(4):32, 2013.
[8]
Benjamin Birnbaum and Claire Mathieu. On-line bipartite matching made simple. SIGACT News, 39(1):80--87, March 2008.
[9]
Niv Buchbinder and Moran Feldman. Deterministic algorithms for submodular maximization problems. In SODA, pages 392--403. SIAM, 2016.
[10]
Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM J. Comput., 44(5):1384--1402, 2015.
[11]
Niv Buchbinder, Moran Feldman, and Roy Schwartz. Online submodular maximization with preemption. In SODA, pages 1202--1216. SIAM, 2015.
[12]
Gruia Calinescu, Chandra Chekuri, Martin Pl, and Jan Vondrk. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740--1766, 2011.
[13]
Amit Chakrabarti and Sagar Kale. Submodular maximization meets streaming: Matchings, matroids, and more. In Integer Programming and Combinatorial Optimization, pages 210--221. Springer, 2014.
[14]
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, and Zhihao Gavin Tang. Online submodular maximization with free disposal: Randomization beats 0.25 for partition matroids. CoRR, abs/1610.07770, 2016.
[15]
Chandra Chekuri, Shalmoli Gupta, and Kent Quanrud. Streaming algorithms for submodular function maximization. In ICALP (1), volume 9134 of Lecture Notes in Computer Science. Springer, 2015.
[16]
Chandra Chekuri and Amit Kumar. Maximum coverage problem with group budget constraints and applications. In APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, pages 72--83. Springer, 2004.
[17]
Florin Constantin, Jon Feldman, S Muthukrishnan, and Martin Pál. An online mechanism for ad slot reservations with cancellations. In Proceedings of the twentieth annual ACM-SIAM symposium on discrete algorithms, pages 1265--1274. Society for Industrial and Applied Mathematics, 2009.
[18]
Nikhil R Devanur, Zhiyi Huang, Nitish Korula, Vahab S Mirrokni, and Qiqi Yan. Whole-page optimization and submodular welfare maximization with online bidders. In Proceedings of the fourteenth ACM conference on Electronic commerce, pages 305--322. ACM, 2013.
[19]
Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. Randomized primal-dual analysis of ranking for online bipartite matching. In SODA, pages 101--107, 2013.
[20]
Debadeepta Dey, Tian Yu Liu, Martial Hebert, and J Andrew Bagnell. Contextual sequence prediction with application to control library optimization. Robotics, page 49, 2013.
[21]
Shahar Dobzinski and Jan Vondrák. On the hardness of welfare maximization in combinatorial auctions with submodular valuations. CoRR, abs/1202.2792, 2012.
[22]
Uriel Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634--652, July 1998.
[23]
Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák. Maximizing non-monotone submodular functions. SIAM Journal on Computing, 40(4):1133--1153, 2011.
[24]
Uriel Feige and Jan Vondrák. The submodular welfare problem with demand queries. Theory of Computing, 6(1):247--290, 2010.
[25]
Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, and Martin Pál. Online ad assignment with free disposal. In WINE, volume 5929 of Lecture Notes in Computer Science, pages 374--385. Springer, 2009.
[26]
Moran Feldman, Joseph Naor, and Roy Schwartz. A unified continuous greedy algorithm for submodular maximization. In FOCS, pages 570--579. IEEE Computer Society, 2011.
[27]
Moran Feldman, Ola Svensson, and Rico Zenklusen. A simple O(log log(rank))-competitive algorithm for the matroid secretary problem. In SODA, pages 1189--1201. SIAM, 2015.
[28]
Moran Feldman and Rico Zenklusen. The submodular secretary problem goes linear. In FOCS, pages 486--505. IEEE Computer Society, 2015.
[29]
Yuval Filmus and Justin Ward. A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20--23, 2012, pages 659--668. IEEE Computer Society, 2012.
[30]
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko. Tight approximation algorithms for maximum general assignment problems. In SODA, pages 611--620. ACM Press, 2006.
[31]
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko. Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res., 36(3):416--431, 2011.
[32]
P. R. Freeman. The secretary problem and its extensions: A review. International Statistical Review / Revue Internationale de Statistique, 51(2):189--206, 1983.
[33]
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. Dependent rounding and its applications to approximation algorithms. J. ACM, 53(3):324--360, 2006.
[34]
Shayan Oveis Gharan and Jan Vondrák. Submodular maximization by simulated annealing. In Dana Randall, editor, SODA 2011, pages 1098--1116. SIAM, 2011.
[35]
Gagan Goel and Aranyak Mehta. Online budgeted matching in random input models with applications to adwords. In SODA, pages 982--991, 2008.
[36]
Daniel Golovin, Andreas Krause, and Matthew Streeter. Online learning of assignments that maximize submodular functions. arXiv preprint arXiv:0908.0772, 2009.
[37]
Daniel Golovin, Andreas Krause, and Matthew Streeter. Online submodular maximization under a matroid constraint with application to learning assignments. arXiv preprint arXiv:1407.1082, 2014.
[38]
Knuth Graham and Donald E Knuth. Patashnik, concrete mathematics. In A Foundation for Computer Science, 1989.
[39]
Anupam Gupta, Aaron Roth, Grant Schoenebeck, and Kunal Talwar. Constrained non-monotone submodular maximization: Offline and secretary algorithms. In WINE, volume 6484 of Lecture Notes in Computer Science, pages 246--257. Springer, 2010.
[40]
Xin Han, Yasushi Kawase, and Kazuhisa Makino. Online unweighted knapsack problem with removal cost. Algorithmica, 70(1):76--91, 2014.
[41]
Kazuo Iwama and Shiro Taketomi. Removable online knapsack problems. In International Colloquium on Automata, Languages, and Programming, pages 293--305. Springer, 2002.
[42]
Frederick Mosteller John P. Gilbert. Recognizing the maximum of a sequence. Journal of the American Statistical Association, 61(313):35--73, 1966.
[43]
Chinmay Karande, Aranyak Mehta, and Pushkar Tripathi. Online bipartite matching with unknown distributions. In STOC, pages 587--596, 2011.
[44]
Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. An optimal algorithm for on-line bipartite matching. In STOC, pages 352--358, 1990.
[45]
Samir Khuller, Anna Moss, and Joseph Seffi Naor. The budgeted maximum coverage problem. Information Processing Letters, 70(1):39--45, 1999.
[46]
Oded Lachish. O(log log rank) competitive ratio for the matroid secretary problem. In FOCS, pages 326--335. IEEE Computer Society, 2014.
[47]
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints. In Michael Mitzenmacher, editor, STOC, pages 323--332. ACM, 2009.
[48]
Tengyu Ma, Bo Tang, and Yajun Wang. The simulated greedy algorithm for several submodular matroid secretary problems. Theory Comput. Syst., 58(4):681--706, 2016.
[49]
Mohammad Mahdian and Qiqi Yan. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In STOC, pages 597--606, 2011.
[50]
G. L. Nemhauser and L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res., 3(3):177--188, 1978.
[51]
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing sub-modular set functions - I. Mathematical Programming, 14(1):265--294, December 1978.
[52]
G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher. An analysis of approximations for maximizing submodular set functions - ii. Mathematical Programming, 14(1):265--294, 1978.
[53]
Ashwinkumar Badanidiyuru Varadaraja. Buyback problem-approximate matroid intersection with cancellation costs. In International Colloquium on Automata, Languages, and Programming, pages 379--390. Springer, 2011.
[54]
Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC, pages 67--74. ACM, 2008.
[55]
Yajun Wang and Sam Chiu-wai Wong. Matroid online bipartite matching and vertex cover. In EC, pages 437--454. ACM, 2016.
Recommendations
Online Submodular Maximization with Free Disposal
We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In ...
Deterministic Algorithms for Submodular Maximization Problems
Special Issue on SODA’16 and Regular PapersRandomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area, most algorithms are randomized, and in almost ...
Continuous submodular maximization: beyond DR-submodularity
NIPS '20: Proceedings of the 34th International Conference on Neural Information Processing SystemsIn this paper, we propose the first continuous optimization algorithms that achieve a constant factor approximation guarantee for the problem of monotone continuous submodular maximization subject to a linear constraint. We first prove that a simple ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIAM Activity Group on Discrete Mathematics
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 16 January 2017
Check for updates
Qualifiers
- Research-article
Conference
SODA '17
Sponsor:
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 80Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Nov 2024
Other Metrics
Citations
Cited By
View all- Wang YFabbri FMathioudakis M(2021)Fair and Representative Subset Selection from Data StreamsProceedings of the Web Conference 202110.1145/3442381.3449799(1340-1350)Online publication date: 19-Apr-2021
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in