Abstract
We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This problem, which we call maximum submodular-function matching (MSM), is a natural generalization of maximum weight matching (MWM). We give two incomparable algorithms for this problem with space usage falling in the semi-streaming range—they store only O(n) edges, using O(nlogn) working memory—that achieve approximation ratios of 7.75 in a single pass and (3 + ε) in O(ε − 3) passes respectively. The operations of these algorithms mimic those of known MWM algorithms. We identify a general framework that allows this kind of adaptation to a broader setting of constrained submodular maximization.
Note. A full version of this extended abstract [1] can be found online at the following URL: http://arxiv.org/abs/1309.2038 .
Supported in part by NSF grant CCF-1217375.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chakrabarti, A., Kale, S.: Submodular maximization meets streaming: Matchings, matroids, and more. arXiv preprint arXiv:1309.2038 (2013)
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2), 207–216 (2005)
McGregor, A.: Finding graph matchings in data streams. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 170–181. Springer, Heidelberg (2005)
Zelke, M.: Weighted matching in the semi-streaming model. In: Proc. 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 669–680 (2008)
Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM Journal on Discrete Mathematics 25(3), 1251–1265 (2011)
Goel, A., Kapralov, M., Khanna, S.: On the communication and streaming complexity of maximum bipartite matching. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 468–485. SIAM (2012)
Kapralov, M.: Better bounds for matchings in the streaming model. In: Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. SIAM (2013)
Badanidiyuru Varadaraja, A.: Buyback problem: approximate matroid intersection with cancellation costs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 379–390. Springer, Heidelberg (2011)
Ahn, K.J., Guha, S.: Linear programming in the semi-streaming model with application to the maximum matching problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 526–538. Springer, Heidelberg (2011)
Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions—I. Mathematical Programming 14(1), 265–294 (1978)
Fisher, M., Nemhauser, G., Wolsey, L.: An analysis of approximations for maximizing submodular set functions—II. In: Balinski, M., Hoffman, A. (eds.) Polyhedral Combinatorics. Mathematical Programming Studies, vol. 8, pp. 73–87. Springer, Heidelberg (1978)
Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011)
Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: Proc. 41st Annual ACM Symposium on the Theory of Computing, STOC 2009, pp. 323–332. ACM, Bethesda (2009)
Lee, J., Sviridenko, M., Vondrák, J.: Submodular maximization over multiple matroids via generalized exchange properties. Mathematics of Operations Research 35(4), 795–806 (2010)
Feldman, M., Naor, J(S.), Schwartz, R., Ward, J.: Improved approximations for k-exchange systems. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 784–798. Springer, Heidelberg (2011)
Badanidiyuru, A., Vondrák, J.: Fast algorithms for maximizing submodular functions. In: Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. SIAM (2014)
Lin, H., Bilmes, J.: Word alignment via submodular maximization over matroids. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers, HLT 2011, vol. 2, pp. 170–175. Association for Computational Linguistics, Stroudsburg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chakrabarti, A., Kale, S. (2014). Submodular Maximization Meets Streaming: Matchings, Matroids, and More. In: Lee, J., Vygen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2014. Lecture Notes in Computer Science, vol 8494. Springer, Cham. https://doi.org/10.1007/978-3-319-07557-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-07557-0_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07556-3
Online ISBN: 978-3-319-07557-0
eBook Packages: Computer ScienceComputer Science (R0)