{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T11:13:43Z","timestamp":1684840423505},"reference-count":18,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T00:00:00Z","timestamp":1362700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"DOI":"10.1007\/s10107-013-0651-2","type":"journal-article","created":{"date-parts":[[2013,3,7]],"date-time":"2013-03-07T03:54:19Z","timestamp":1362628459000},"source":"Crossref","is-referenced-by-count":4,"title":["Preemptive and non-preemptive generalized min sum set cover"],"prefix":"10.1007","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"van der Zwaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,8]]},"reference":[{"key":"651_CR1","doi-asserted-by":"crossref","unstructured":"Azar, Y., Gamzu, I., Yin, X.: Multiple intents re-ranking. In: Proceedings of ACM Symposium on Theory of Computing, pp. 669\u2013678 (2009)","DOI":"10.1145\/1536414.1536505"},{"key":"651_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Gupta, A., Krishnaswamy, R.: A constant factor approximation algorithm for generalized min-sum set cover. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 1539\u20131545 (2010)","DOI":"10.1137\/1.9781611973075.125"},{"key":"651_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khot, S.: Optimal long code test with one free bit. In: Proceedings of Symposium on Foundations of Computer Science, pp. 453\u2013462 (2009)","DOI":"10.1109\/FOCS.2009.23"},{"issue":"2","key":"651_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183\u2013202 (1998)","journal-title":"Inf. Comput."},{"issue":"3","key":"651_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0020-0190(99)00104-0","volume":"71","author":"A Bar-Noy","year":"1999","unstructured":"Bar-Noy, A., Halld\u00f3rsson, M.M., Kortsarz, G.: A matched approximation bound for the sum of a greedy coloring. Inf. Process. Lett. 71(3), 135\u2013140 (1999)","journal-title":"Inf. Process. Lett."},{"key":"651_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10556780108805818","volume":"15","author":"S Burer","year":"2001","unstructured":"Burer, S., Monteiro, R.: A projected gradient algorithm for solving the maxcut sdp relaxation. Optim. Methods Softw. 15, 175\u2013200 (2001)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20132","key":"651_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0166-218X(98)00143-7","volume":"98","author":"C Chekuri","year":"1999","unstructured":"Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discret. Appl. Math. 98(1\u20132), 29\u201338 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"651_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min sum set cover. Algorithmica 40(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"651_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2","author":"M Grotschel","year":"1993","unstructured":"Grotschel, M., Lov\u00e1sz, L.L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"issue":"3","key":"651_CR10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res. 22(3), 513\u2013544 (1997)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"651_CR11","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.51.6.981.24912","volume":"51","author":"F Margot","year":"2003","unstructured":"Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows, and a precedence constrained single-machine scheduling problem. Oper. Res. 51(6), 981\u2013992 (2003)","journal-title":"Oper. Res."},{"key":"651_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"651_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0196-6774(02)00251-1","volume":"45","author":"M Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: A $(2+\\varepsilon )$-approximation algorithm for the generalized preemptive open shop problem with minsum objective. J. Algorithms 45(2), 202\u2013212 (2002)","journal-title":"J. Algorithms"},{"key":"651_CR14","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Alexander Schrijver","year":"2003","unstructured":"Schrijver, Alexander: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"651_CR15","doi-asserted-by":"crossref","unstructured":"Schulz, A., Skutella, M.: Random-based scheduling: new approximations and lp lower bounds. In: RANDOM, pp. 119\u2013133 (1997)","DOI":"10.1007\/3-540-63248-4_11"},{"key":"651_CR16","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B.: Using linear programming in the design and analysis of approximation algorithms: two illustrative problems. In: APPROX, pp. 15\u201332 (1998)","DOI":"10.1007\/BFb0053960"},{"issue":"6","key":"651_CR17","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.orl.2011.08.002","volume":"39","author":"M Skutella","year":"2011","unstructured":"Skutella, M., Williamson, D.P.: A note on the generalized min-sum set cover problem. Oper. Res. Lett. 39(6), 433\u2013436 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"651_CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0166-218X(02)00427-4","volume":"131","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. Discret. Appl. Math. 131(1), 237\u2013252 (2003)","journal-title":"Discret. Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0651-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0651-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0651-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T15:26:44Z","timestamp":1562772404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0651-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,8]]},"references-count":18,"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0651-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,8]]}}}