{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:29:11Z","timestamp":1774945751550,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642220050","type":"print"},{"value":"9783642220067","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_29","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"342-353","source":"Crossref","is-referenced-by-count":22,"title":["Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm"],"prefix":"10.1007","author":[{"given":"Moran","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. To appear in SIAM J. Comput."},{"key":"29_CR2","first-page":"575","volume-title":"51st Annual Symposium on Foundations of Computer Science","author":"C. Chekuri","year":"2010","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 51st Annual Symposium on Foundations of Computer Science, pp. 575\u2013584. IEEE Computer Society, Washington DC (2010)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. To appear in the 42nd ACM Symposium on Theory of Computer Science (2011)","DOI":"10.1145\/1993636.1993740"},{"key":"29_CR4","first-page":"461","volume-title":"48th Annual IEEE Symposium on Foundations of Computer Science","author":"U. Feige","year":"2007","unstructured":"Feige, U., Mirrokni, V.S., Vondr\u00e1k, J.: Maximizing non-monotone submodular functions. In: 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 461\u2013471. IEEE Computer Society, Washington DC (2007)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Vondr\u00e1k, J.: Submodular maximization by simulated annealing. In: 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 1096\u20131116 (2011)","DOI":"10.1137\/1.9781611973082.83"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-17572-5_20","volume-title":"Internet and Network Economics","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: Offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 246\u2013257. Springer, Heidelberg (2010)"},{"key":"29_CR8","first-page":"671","volume-title":"50th Annual IEEE Symposium on Foundations of Computer Science","author":"S. Iwata","year":"2009","unstructured":"Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 671\u2013680. IEEE Computer Society, Washington DC (2009)"},{"key":"29_CR9","unstructured":"Jegelka, S., Bilmes, J.: Cooperative cuts: Graph cuts with submodular edge weights. Technical report, Max Planck Institute for Biological Cybernetics (2010)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/1.9781611973068.60","volume-title":"20th ACM-SIAM Symposium on Discrete Algorithms","author":"A. Kulik","year":"2009","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 545\u2013554. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"issue":"4","key":"29_CR11","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 J. Discrete Mathematics\u00a023(4), 2053\u20132078 (2010)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-03685-9_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"J. Lee","year":"2009","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 244\u2013257. Springer, Heidelberg (2009)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming: the State of the Art","author":"L. Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming: the State of the Art, pp. 235\u2013257. Springer, Berlin (1983)"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"L. Lov\u00e1sz","year":"1981","unstructured":"Lov\u00e1sz, L., Gr\u00f6tschel, M., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatoria\u00a01(2), 169\u2013197 (1981)","journal-title":"Combinatoria"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/FOCS.2008.66","volume-title":"49th Annual IEEE Symposium on Foundations of Computer Science","author":"Z. Svitkina","year":"2008","unstructured":"Svitkina, Z., Fleischer, L.: Submodular approximation: Sampling-based algorithms and lower bounds. In: 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 697\u2013706. IEEE Computer Society, Washington DC (2008)"},{"key":"29_CR16","first-page":"67","volume-title":"40th ACM Symposium on Theory of Computer Science","author":"J. Vondr\u00e1k","year":"2008","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: 40th ACM Symposium on Theory of Computer Science, pp. 67\u201374. ACM, New York (2008)"},{"key":"29_CR17","first-page":"651","volume-title":"50th Annual IEEE Symposium on Foundations of Computer Science","author":"J. Vondr\u00e1k","year":"2009","unstructured":"Vondr\u00e1k, J.: Symmetry and approximability of submodular maximization problems. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 651\u2013670. IEEE Computer Society, Washington DC (2009)"},{"issue":"4","key":"29_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02(4), 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:47:56Z","timestamp":1560289676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}