{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:30:30Z","timestamp":1773815430089,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319623887","type":"print"},{"value":"9783319623894","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_39","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"469-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Shenmaier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1134\/S1990478908010043","volume":"2","author":"AE Baburin","year":"2008","unstructured":"Baburin, A.E., Gimadi, E.K., Glebov, N.I., Pyatkin, A.V.: The problem of finding a subset of vectors with the maximum total weight. J. Appl. Industr. Math. 2(1), 32\u201338 (2008)","journal-title":"J. Appl. Industr. Math."},{"issue":"3","key":"39_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1134\/S1990478907030027","volume":"1","author":"AE Baburin","year":"2007","unstructured":"Baburin, A.E., Pyatkin, A.V.: Polynomial algorithms for solving the vector sum problem. J. Appl. Industr. Math. 1(3), 268\u2013272 (2007)","journal-title":"J. Appl. Industr. Math."},{"issue":"Suppl 1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1134\/S0081543816090066","volume":"295","author":"AV Dolgushev","year":"2016","unstructured":"Dolgushev, A.V., Kel\u2019manov, A.V., Shenmaier, V.V.: Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters. Proc. Steklov Inst. Math. 295(Suppl 1), 47\u201356 (2016)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15(2), 341\u2013363 (1986)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1134\/S1054661808010057","volume":"18","author":"EK Gimadi","year":"2008","unstructured":"Gimadi, E.K., Kel\u2019manov, A.V., Kel\u2019manova, M.A., Khamidullin, S.A.: A posteriori detecting a quasiperiodic fragment in a numerical sequence. Pattern Recogn. Image Anal. 18(1), 30\u201342 (2008)","journal-title":"Pattern Recogn. Image Anal."},{"issue":"4","key":"39_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM 48(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Holmerin, J., Khot, S.: A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. In: 36th Annual ACM Symposium on Theory of Computing, pp. 11\u201320. ACM, New York (2004)","DOI":"10.1145\/1007352.1007362"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/S1052623497344002","volume":"10","author":"FK Hwang","year":"1999","unstructured":"Hwang, F.K., Onn, S., Rothblum, U.G.: A polynomial time algorithm for shaped partition problems. SIAM J. Optim. 10(1), 70\u201381 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"key":"39_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"issue":"3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/moor.26.3.583.10587","volume":"26","author":"S Onn","year":"2001","unstructured":"Onn, S., Schulman, L.J.: The vector partition problem for convex objective functions. Math. Oper. Res. 26(3), 583\u2013590 (2001)","journal-title":"Math. Oper. Res."},{"key":"39_CR12","unstructured":"Onn, S.: Personal communication, November 2016"},{"issue":"4","key":"39_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1134\/S1990478910040095","volume":"4","author":"AV Pyatkin","year":"2010","unstructured":"Pyatkin, A.V.: On the complexity of the maximum sum length vectors subset choice problem. J. Appl. Industr. Math. 4(4), 549\u2013552 (2010)","journal-title":"J. Appl. Industr. Math."},{"issue":"4","key":"39_CR14","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1134\/S199047891604013X","volume":"10","author":"VV Shenmaier","year":"2016","unstructured":"Shenmaier, V.V.: Solving some vector subset problems by Voronoi diagrams. J. Appl. Industr. Math. 10(4), 560\u2013566 (2016)","journal-title":"J. Appl. Industr. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:26:17Z","timestamp":1709810777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}