{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:48:27Z","timestamp":1725828507471},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_44","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"521-532","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Symmetric Submodular Functions"],"prefix":"10.1007","author":[{"given":"Moran","family":"Feldman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 649\u2013658. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.73"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: Submodular maximization with cardinality constraints. In: The Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1433\u20131452. SIAM (2014)","DOI":"10.1137\/1.9781611973730.80"},{"issue":"6","key":"44_CR3","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G. Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing\u00a040(6), 1740\u20131766 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding. In: The Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1080\u20131097. SIAM (2011)","DOI":"10.1137\/1.9781611973082.82"},{"issue":"6","key":"44_CR5","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1137\/110839655","volume":"43","author":"C. Chekuri","year":"2014","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput.\u00a043(6), 1831\u20131879 (2014)","journal-title":"SIAM J. Comput."},{"key":"44_CR6","unstructured":"Devanur, N.R., Dughmi, S., Schwartz, R., Sharma, A., Singh, M.: On the approximation of submodular functions. CoRR abs\/1304.4948 (2013)"},{"key":"44_CR7","unstructured":"Dughmi, S.: Submodular functions: Extensions, distributions, and algorithms. A survey. CoRR abs\/0912.0322 (2009)"},{"issue":"4","key":"44_CR8","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U. Feige","year":"2011","unstructured":"Feige, U., Mirrokni, V.S., Vondr\u00e1k, J.: Maximizing non-monotone submodular functions. SIAM Journal on Computing\u00a040(4), 1133\u20131153 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"44_CR9","unstructured":"Feldman, M.: Maximization Problems with Submodular Objective Functions. Ph.D. thesis, Computer Science Department, Technion - Israel Institute of Technology (2013)"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-22006-7_29","volume-title":"Automata, Languages and Programming","author":"M. Feldman","year":"2011","unstructured":"Feldman, M., Naor, J.S., Schwartz, R.: Nonmonotone submodular maximization via a structural continuous greedy algorithm. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 342\u2013353. Springer, Heidelberg (2011)"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J.S., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 570\u2013579. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.46"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Vondr\u00e1k, J.: Submodular maximization by simulated annealing. In: The Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1098\u20131117. SIAM (2011)","DOI":"10.1137\/1.9781611973082.83"},{"issue":"2","key":"44_CR13","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/120891502","volume":"27","author":"M.X. Goemans","year":"2013","unstructured":"Goemans, M.X., Soto, J.A.: Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations. SIAM J. Discrete Math.\u00a027(2), 1123\u20131145 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/978-3-319-13075-0_42","volume-title":"Algorithms and Computation","author":"N. Huang","year":"2014","unstructured":"Huang, N., Borodin, A.: Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol.\u00a08889, pp. 528\u2013539. Springer, Heidelberg (2014)"},{"issue":"4","key":"44_CR15","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/090750020","volume":"23","author":"J. Lee","year":"2010","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Maximizing non-monotone submodular functions under matroid or knapsack constraints. SIAM Journal on Discrete Mathematics\u00a023(4), 2053\u20132078 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"44_CR16","doi-asserted-by":"publisher","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.\u00a035(4), 795\u2013806 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"44_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00453-008-9239-2","volume":"56","author":"H. Nagamochi","year":"2010","unstructured":"Nagamochi, H.: Minimum degree orderings. Algorithmica\u00a056(1), 17\u201334 (2010)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"44_CR18","first-page":"3","volume":"82","author":"M. Queyranne","year":"1998","unstructured":"Queyranne, M.: Minimizing symmetric submodular functions. Mathematical Programming\u00a082(1\u20132), 3\u201312 (1998)","journal-title":"Mathematical Programming"},{"issue":"1","key":"44_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1137\/110832318","volume":"42","author":"J. Vondr\u00e1k","year":"2013","unstructured":"Vondr\u00e1k, J.: Symmetry and approximability of submodular maximization problems. SIAM J. Comput.\u00a042(1), 265\u2013304 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:08:11Z","timestamp":1559232491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}