{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T05:49:28Z","timestamp":1785044968203,"version":"3.55.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T00:00:00Z","timestamp":1427760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-015-0900-7","type":"journal-article","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T03:31:45Z","timestamp":1427686305000},"page":"225-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":66,"title":["Submodular maximization meets streaming: matchings, matroids, and more"],"prefix":"10.1007","volume":"154","author":[{"given":"Amit","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sagar","family":"Kale","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,31]]},"reference":[{"issue":"2","key":"900_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2), 207 (2005). doi: 10.1016\/j.tcs.2005.09.013","journal-title":"Theor. Comput. Sci."},{"key":"900_CR2","doi-asserted-by":"crossref","unstructured":"McGregor, A.: Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 170\u2013181. Springer, Berlin, Heidelberg (2005). APPROX\u201905\/RANDOM\u201905. doi: 10.1007\/11538462_15","DOI":"10.1007\/11538462_15"},{"key":"900_CR3","unstructured":"Zelke, M.: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, pp. 669\u2013680 (2008). STACS \u201908"},{"issue":"3","key":"900_CR4","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1137\/100801901","volume":"25","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251 (2011). doi: 10.1137\/100801901","journal-title":"SIAM J. Discrete Math."},{"key":"900_CR5","unstructured":"Goel, A., Kapralov, M., Khanna, S.: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 468\u2013485. SIAM (2012). SODA \u201912. http:\/\/dl.acm.org\/citation.cfm?id=2095116.2095157"},{"key":"900_CR6","unstructured":"Kapralov, M.: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2013). SODA \u201913"},{"key":"900_CR7","unstructured":"Feldman, M., Naor, J., Schwartz, R., Ward, J.: Proceedings of the 19th Annual European Symposium on Algorithms, pp. 784\u2013798. Springer, Berlin, Heidelberg (2011). ESA\u201911 http:\/\/dl.acm.org\/citation.cfm?id=2040572.2040658"},{"key":"900_CR8","unstructured":"Edmonds, J.: Can. J. Math. 17, 449 (1965). www.cs.berkeley.edu\/christos\/classics\/edmonds.ps"},{"issue":"1","key":"900_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/6462.6502","volume":"18","author":"Z Galil","year":"1986","unstructured":"Galil, Z.: Efficient algorithms for finding maximum matchings in graphs. ACM Comput. Surv. 18(1), 23 (1986)","journal-title":"ACM Comput. Surv."},{"key":"900_CR10","unstructured":"Badanidiyuru Varadaraja, A.: Proceedings of the 38th International Colloquium Conference on Automata, Languages and Programming, volume Part I, pp. 379\u2013390. Springer, Berlin, Heidelberg (2011). ICALP\u201911. http:\/\/arxiv.org\/abs\/1009.5037"},{"key":"900_CR11","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S.: In: Aceto, L., Henzinger, M., Sgall, J. (eds.) Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 6756, pp. 526\u2013538. Springer, Berlin, Heidelberg (2011). doi: 10.1007\/978-3-642-22012-8_42","DOI":"10.1007\/978-3-642-22012-8_42"},{"key":"900_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"issue":"1","key":"900_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions\u2014I. Math. Program. 14(1), 265 (1978). doi: 10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"900_CR14","doi-asserted-by":"crossref","unstructured":"Fisher, M., Nemhauser, G., Wolsey, L.: In: Balinski, M., Hoffman, A. (eds.) Polyhedral Combinatorics, Mathematical Programming Studies, vol. 8, pp. 73\u201387. Springer, Berlin Heidelberg (1978). doi: 10.1007\/BFb0121195","DOI":"10.1007\/BFb0121195"},{"key":"900_CR15","unstructured":"Jenkyns, T.A.: Proceedings of the 7th South Eastern Conference on Combinatorics, Graph Theory and Computing, pp. 341\u2013350 (1976)"},{"issue":"6","key":"900_CR16","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740 (2011). doi: 10.1137\/080733991","journal-title":"SIAM J. Comput."},{"key":"900_CR17","doi-asserted-by":"crossref","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Proceedings of the 41st Annual ACM Symposium on the Theory of Computing, pp. 323\u2013332. ACM, Bethesda, MD, USA (2009). STOC \u201909. doi: 10.1145\/1536414.1536459","DOI":"10.1145\/1536414.1536459"},{"issue":"4","key":"900_CR18","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4), 795 (2010). doi: 10.1287\/moor.1100.0463","journal-title":"Math. Oper. Res."},{"key":"900_CR19","unstructured":"Badanidiyuru, A., Vondr\u00e1k, J.: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2014). SODA \u201914 to appear"},{"key":"900_CR20","unstructured":"Lin, H., Bilmes, J.: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: Short Papers, volume 2, pp. 170\u2013175. Association for Computational Linguistics, Stroudsburg, PA, USA (2011). HLT \u201911. http:\/\/dl.acm.org\/citation.cfm?id=2002736.2002773"},{"key":"900_CR21","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177 (1978). http:\/\/www.jstor.org\/stable\/3689488","DOI":"10.1287\/moor.3.3.177"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0900-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0900-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0900-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T18:58:47Z","timestamp":1747853927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0900-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,31]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0900-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,31]]}}}