{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T12:32:20Z","timestamp":1706790740341},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,8]],"date-time":"2013-12-08T00:00:00Z","timestamp":1386460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-013-9685-x","type":"journal-article","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T10:01:21Z","timestamp":1386410481000},"page":"1107-1124","source":"Crossref","is-referenced-by-count":3,"title":["An accelerated continuous greedy algorithm for maximizing strong submodular functions"],"prefix":"10.1007","volume":"30","author":[{"given":"Zengfu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuezhi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,8]]},"reference":[{"issue":"3","key":"9685_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A Ageev","year":"2004","unstructured":"Ageev A, Sviridenko M (2004) Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J Comb Optim 8(3):307\u2013328","journal-title":"J Comb Optim"},{"key":"9685_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S000497270004140X","volume":"1","author":"RA Brualdi","year":"1969","unstructured":"Brualdi RA (1969) Comments on bases in dependence structures. Bull Aust Math Soc 1:161\u2013167","journal-title":"Bull Aust Math Soc"},{"issue":"6","key":"9685_CR3","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu G, Chekuri M, Vondr\u00e1k J (2011) Maximizing a submodular set function subject to a matroid constraint. SIAM J Comput 40(6):1740\u20131766","journal-title":"SIAM J Comput"},{"key":"9685_CR4","first-page":"53","volume-title":"A characterization of a cone of pseudo-boolean functions via supermodularity-type inequalities. Quantitative Methoden in den Wirtschaftswissenschaften","author":"Y Crama","year":"1989","unstructured":"Crama Y, Hammer PL, Holzman R (1989) A characterization of a cone of pseudo-boolean functions via supermodularity-type inequalities. Quantitative Methoden in den Wirtschaftswissenschaften. Springer, Berlin, pp 53\u201355"},{"key":"9685_CR5","first-page":"1880","volume":"3","author":"S Dughmi","year":"2009","unstructured":"Dughmi S (2009) Submodular functions: extensions, distributions, and algorithms a survey. CORR 3:1880\u20131889","journal-title":"CORR"},{"issue":"6","key":"9685_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.orl.2011.10.002","volume":"39","author":"S Fadaei","year":"2011","unstructured":"Fadaei S, Fazli M, Safari M (2011) Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms. Oper Res Lett 39(6):447\u2013451","journal-title":"Oper Res Lett"},{"issue":"4","key":"9685_CR7","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of $$\\ln n$$ ln n for approximation set cover. JACM 45(4):634\u2013652","journal-title":"JACM"},{"key":"9685_CR8","doi-asserted-by":"crossref","unstructured":"Filmus Y, Ward J (2012a) A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In: Proceedings of IEEE FOCS, pp 659\u2013668","DOI":"10.1109\/FOCS.2012.55"},{"key":"9685_CR9","unstructured":"Filmus Y, Ward J (2012b) The power of local search: maximum coverage over a matroid. In: 29th international symposium on theoretical aspects of computer science, pp 601\u2013612"},{"key":"9685_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"ML Fisher","year":"1978","unstructured":"Fisher ML, Nemhauser GL, Wolsey LA (1978) An analysis of approximations for maximizing submodular set functions\u2014II. Math Program Study 8:73\u201387","journal-title":"Math Program Study"},{"issue":"2","key":"9685_CR11","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/moor.1040.0128","volume":"30","author":"S Foldes","year":"2005","unstructured":"Foldes S, Hammer PL (2005) Submodularity, supermodularity, and higher-order monotonicites of pseudo-boolean functions. Math Oper Res 30(2):453\u2013461","journal-title":"Math Oper Res"},{"issue":"1","key":"9685_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-007-9105-7","volume":"52","author":"S Khot","year":"2008","unstructured":"Khot S, Lipton R, Markakis E, Naor J (2008) Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica 52(1):3\u201318","journal-title":"Algorithmica"},{"key":"9685_CR13","doi-asserted-by":"crossref","unstructured":"Kulik A, Shachnai H, Tamir T (2009) Maximizing submodular set functions subject to multiple linear constraints. In: Proceedings of the annual ACM-SIAM symposium on discrete algorithms, pp 545\u2013554","DOI":"10.1137\/1.9781611973068.60"},{"key":"9685_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann B, Lehmann DJ, Nisan N (2006) Combinatorial auctions with decreasing marginal utilities. Games Econ Behav 55:270\u2013296","journal-title":"Games Econ Behav"},{"key":"9685_CR15","doi-asserted-by":"crossref","unstructured":"Mirrokni V, Schapira M , Vondr\u00e1k J (2008) Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In: Proceedings of ACM EC, pp 70\u201377","DOI":"10.1145\/1386790.1386805"},{"issue":"3","key":"9685_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"GL Nembauser","year":"1978","unstructured":"Nembauser GL, Wolsey LA (1978) Best algorithms for approximating the maximum of a submodular set function. Math Oper Res 3(3):177\u2013188","journal-title":"Math Oper Res"},{"issue":"1","key":"9685_CR17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"9685_CR18","doi-asserted-by":"crossref","unstructured":"Salek M, Shayandeh S, Kempe D (2010) You share, I share: network effects and economic incentives in P2P file-sharing systems. In: Proceedings of the 6th international conference on internet and network, economics, pp 354\u2013365","DOI":"10.1007\/978-3-642-17572-5_29"},{"issue":"1","key":"9685_CR19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343","journal-title":"Oper Res Lett"},{"key":"9685_CR20","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k J (2008) Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the annual ACM symposium on theory of, computing, pp 67\u201374","DOI":"10.1145\/1374376.1374389"},{"key":"9685_CR21","unstructured":"Vondr\u00e1k J (2010) Submodularity and curvature: the optimal algorithm. In: RIMS Kokyuroku Bessatsu B23, pp 253\u2013266"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9685-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9685-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9685-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:22Z","timestamp":1559276602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9685-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,8]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9685"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9685-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,8]]}}}