{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:44:44Z","timestamp":1742931884739,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319894409"},{"type":"electronic","value":"9783319894416"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-89441-6_4","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"41-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity and Approximation of the Longest Vector Sum Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4692-1994","authenticated-orcid":false,"given":"Vladimir","family":"Shenmaier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"key":"4_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1214\/009117904000000874","volume":"33","author":"F Barthe","year":"2005","unstructured":"Barthe, F., Gu\u00e9don, O., Mendelson, S., Naor, A.: A probabilistic approach to the geometry of the $$l_p^n$$-ball. Ann. Probab. 33(2), 480\u2013513 (2005)","journal-title":"Ann. Probab."},{"issue":"1","key":"4_CR3","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. Ind. Math. 2(1), 32\u201338 (2008)","journal-title":"J. Appl. Ind. Math."},{"issue":"3","key":"4_CR4","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. Ind. Math. 1(3), 268\u2013272 (2007)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1051\/ita\/2016022","volume":"50","author":"\u00c9 Bonnet","year":"2016","unstructured":"Bonnet, \u00c9., Paschos, V.T., Sikora, F.: Parameterized exact and approximation algorithms for maximum $$k$$-set cover and related satisfiability problems. RAIRO-Theor. Inform. Appl. 50(4), 227\u2013240 (2016)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","volume":"51","author":"L Cai","year":"2008","unstructured":"Cai, L.: Parameterized complexity of cardinality constrained optimization problems. Comput. J. 51(1), 102\u2013121 (2008)","journal-title":"Comput. J."},{"issue":"Suppl 1","key":"4_CR7","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":"4","key":"4_CR8","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 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"4_CR9","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."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-44914-2_12","volume-title":"Discrete Optimization and Operations Research","author":"E Gimadi","year":"2016","unstructured":"Gimadi, E., Rykov, I.: Efficient randomized algorithm for a vector subset problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 148\u2013158. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_12"},{"issue":"4","key":"4_CR11","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":"4_CR12","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":"4_CR13","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":"4_CR14","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."},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4(4), 359\u2013412 (1993)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"4_CR16","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":"4_CR17","unstructured":"Onn, S.: Personal communication, November 2016"},{"issue":"10","key":"4_CR18","doi-asserted-by":"publisher","first-page":"3187","DOI":"10.1016\/j.spa.2017.02.007","volume":"127","author":"G Paouris","year":"2017","unstructured":"Paouris, G., Valettas, P., Zinn, J.: Random version of Dvoretzky\u2019s theorem in $$\\ell _p^n$$. Stochast. Process. Appl. 127(10), 3187\u20133227 (2017)","journal-title":"Stochast. Process. Appl."},{"issue":"4","key":"4_CR19","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. Ind. Math. 4(4), 549\u2013552 (2010)","journal-title":"J. Appl. Ind. Math."},{"key":"4_CR20","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"4","key":"4_CR21","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. Ind. Math. 10(4), 560\u2013566 (2016). https:\/\/doi.org\/10.1134\/S199047891604013X","journal-title":"J. Appl. Ind. Math."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-319-62389-4_39","volume-title":"Computing and Combinatorics","author":"V Shenmaier","year":"2017","unstructured":"Shenmaier, V.: Complexity and algorithms for finding a subset of vectors with the longest sum. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 469\u2013480. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_39"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1134\/S1990478917040160","volume":"11","author":"VV Shenmaier","year":"2017","unstructured":"Shenmaier, V.V.: An exact algorithm for finding a vector subset with the longest sum. J. Appl. Ind. Math. 11(4), 584\u2013593 (2017). https:\/\/doi.org\/10.1134\/S1990478917040160","journal-title":"J. Appl. Ind. Math."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89441-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:19:40Z","timestamp":1710245980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}