{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:06Z","timestamp":1725744906008},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_35","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"409-420","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing a Submodular Function with Viability Constraints"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TCBB.2007.70252","volume":"5","author":"M. Bordewich","year":"2008","unstructured":"Bordewich, M., Semple, C.: Nature reserve selection problem: A tight approximation algorithm. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a05(2), 275\u2013280 (2008)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"1-2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00285-011-0405-9","volume":"64","author":"M. Bordewich","year":"2012","unstructured":"Bordewich, M., Semple, C.: Budgeted nature reserve selection with diversity feature loss and arbitrary split systems. Journal of Mathematical Biology\u00a064(1-2), 69\u201385 (2012)","journal-title":"Journal of Mathematical Biology"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0006-3207(92)91201-3","volume":"61","author":"D.P. Faith","year":"1992","unstructured":"Faith, D.P.: Faith. Conservation evaluation and phylogenetic diversity. Biological Conservation\u00a061(1), 1\u201310 (1992)","journal-title":"Biological Conservation"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00026-011-0093-6","volume":"15","author":"B. Faller","year":"2011","unstructured":"Faller, B., Semple, C., Welsh, D.: Optimizing Phylogenetic Diversity with Ecological Constraints. Annals of Combinatorics\u00a015, 255\u2013266 (2011)","journal-title":"Annals of Combinatorics"},{"issue":"4","key":"35_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"M.L. Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions \u2013 II. Mathematical Programming Study\u00a08, 73\u201387 (1978)","journal-title":"Mathematical Programming Study"},{"key":"35_CR7","unstructured":"Goundan, P.R., Schulz, A.S.: Revisiting the greedy approach to submodular set function maximization. Working Paper, Massachusetts Institute of Technology (2007), \n                  \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2007\/08\/1740.html"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett.\u00a070(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31-June 2, pp. 323\u2013332. ACM (2009)","DOI":"10.1145\/1536414.1536459"},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.jtbi.2006.12.021","volume":"246","author":"V. Moulton","year":"2007","unstructured":"Moulton, V., Semple, C., Steel, M.: Optimizing phylogenetic diversity under constraints. Journal of Theoretical Biology\u00a0246(1), 186\u2013194 (2007)","journal-title":"Journal of Theoretical Biology"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions \u2014 I. Mathematical Programming\u00a014, 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1371\/journal.pgen.0010071.eor","volume":"71","author":"F. Pardi","year":"2005","unstructured":"Pardi, F., Goldman, N.: Species choice for comparative genomics: being greedy works. PLoS Genetics\u00a071, 71 (2005)","journal-title":"PLoS Genetics"},{"issue":"1","key":"35_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10878-005-5487-0","volume":"9","author":"T.S. Hsu","year":"2005","unstructured":"Hsu, T.S., Tsai, K.-H., Wang, D.-W., Lee, D.T.: Two variations of the minimum steiner problem. J. Comb. Optim.\u00a09(1), 101\u2013120 (2005)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"35_CR14","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1080\/10635150590947023","volume":"54","author":"M. Steel","year":"2005","unstructured":"Steel, M.: Phylogenetic diversity and the greedy algorithm. Systematic Biology\u00a054(4), 527\u2013529 (2005)","journal-title":"Systematic Biology"},{"key":"35_CR15","unstructured":"Vondr\u00e1k, J.: Submodular functions and their applications. In: SODA 2013 Plenary Talk (2013) Slides available at, \n                  \n                    http:\/\/theory.stanford.edu\/~jvondrak\/data\/SODA-plenary-talk.pdf"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.2307\/2999617","volume":"66","author":"M.L. Weitzman","year":"1998","unstructured":"Weitzman, M.L.: The Noah\u2019s ark problem. Econometricay\u00a066, 1279\u20131298 (1998)","journal-title":"Econometricay"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:58:29Z","timestamp":1558011509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}