{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:23:50Z","timestamp":1742941430034,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_6","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"73-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximating Subset Sum Ratio via\u00a0Subset Sum Computations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1277-5017","authenticated-orcid":false,"given":"Giannis","family":"Alonistiotis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1368-6334","authenticated-orcid":false,"given":"Antonis","family":"Antonopoulos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0864-9803","authenticated-orcid":false,"given":"Nikolaos","family":"Melissinos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6220-3722","authenticated-orcid":false,"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7825-2839","authenticated-orcid":false,"given":"Stavros","family":"Petsalakis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6505-2977","authenticated-orcid":false,"given":"Manolis","family":"Vasilakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Bringmann, K., Hermelin, D., Shabtay, D.: Seth-based lower bounds for subset sum and bicriteria path. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, 6\u20139 January 2019, pp. 41\u201357. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.3","DOI":"10.1137\/1.9781611975482.3"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Antonopoulos, A., Pagourtzis, A., Petsalakis, S., Vasilakis, M.: Faster algorithms for $$k$$-subset sum and variations. In: J., Chen, Li, M., Zhang, G. (eds.): Frontiers of Algorithmics - International Joint Conference, IJTCS-FAW 2021, Beijing, 16\u201319 August 2021, Proceedings. LNCS, vol. 12874, pp. 37\u201352. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-97099-4_3","DOI":"10.1007\/978-3-030-97099-4_3"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Austrin, P., Kaski, P., Koivisto, M., Nederlof, J.: Subset sum in the absence of concentration. In: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, 4\u20137 March 2015, Garching. LIPIcs, vol. 30, pp. 48\u201361. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.48","DOI":"10.4230\/LIPIcs.STACS.2015.48"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Austrin, P., Kaski, P., Koivisto, M., Nederlof, J.: Dense subset sum may be the hardest. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, 17\u201320 February 2016. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.13","DOI":"10.4230\/LIPIcs.STACS.2016.13"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/jcss.2001.1784","volume":"64","author":"C Bazgan","year":"2002","unstructured":"Bazgan, C., Santha, M., Tuza, Z.: Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem. J. Comput. Syst. Sci. 64(2), 160\u2013170 (2002). https:\/\/doi.org\/10.1006\/jcss.2001.1784","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR6","volume-title":"Dynamic Programming","author":"RE Bellman","year":"1957","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bringmann, K.: A near-linear pseudopolynomial time algorithm for subset sum. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. pp. 1073\u20131084. SIAM, Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.69","DOI":"10.1137\/1.9781611974782.69"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Nakos, V.: Top-k-convolution and the quest for near-linear output-sensitive subset sum. In: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pp. 982\u2013995. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3357713.3384308","DOI":"10.1145\/3357713.3384308"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Nakos, V.: A fine-grained perspective on approximating subset sum and partition. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10\u201313 January 2021, pp. 1797\u20131815. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.108","DOI":"10.1137\/1.9781611976465.108"},{"key":"6_CR10","series-title":"6th Latin American Symposium Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-24698-5_42","volume-title":"LATIN 2004 Theoretical Informatics","author":"M Cieliebak","year":"2004","unstructured":"Cieliebak, M., Eidenbenz, S.J.: Measurement errors make the partial digest problem np-hard. In: LATIN 2004 Theoretical Informatics. 6th Latin American Symposium Lecture Notes in Computer Science, vol. 2976, pp. 379\u2013390. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_42"},{"key":"6_CR11","series-title":"14th International Symposium, FCT 2003 Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-45077-1_10","volume-title":"Fundamentals of Computation Theory","author":"M Cieliebak","year":"2003","unstructured":"Cieliebak, M., Eidenbenz, S.J., Pagourtzis, A.: Composing equipotent teams. In: Fundamentals of Computation Theory. 14th International Symposium, FCT 2003 Lecture Notes in Computer Science, vol. 2751, pp. 98\u2013108. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45077-1_10"},{"issue":"3","key":"6_CR12","first-page":"151","volume":"14","author":"M Cieliebak","year":"2008","unstructured":"Cieliebak, M., Eidenbenz, S.J., Pagourtzis, A., Schlude, K.: On the complexity of variations of equal sum subsets. Nord. J. Comput. 14(3), 151\u2013172 (2008)","journal-title":"Nord. J. Comput."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-39763-2_9","volume-title":"Algorithms in Bioinformatics, Third International Workshop, WABI 2003","author":"M Cieliebak","year":"2003","unstructured":"Cieliebak, M., Eidenbenz, S.J., Penna, P.: Noisy data make the partial digest problem NP-hard. In: Algorithms in Bioinformatics, Third International Workshop, WABI 2003. Lecture Notes in Computer Science, vol. 2812, pp. 111\u2013123. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39763-2_9"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Cygan, M., Mucha, M., Wegrzycki, K., Wlodarczyk, M.: On problems equivalent to (min, +)-convolution. ACM Trans. Algorithms 15(1), 14:1\u201314:25 (2019). https:\/\/doi.org\/10.1145\/3293465","DOI":"10.1145\/3293465"},{"key":"6_CR15","unstructured":"Dutta, P., Rajasree, M.S.: Efficient reductions and algorithms for variants of subset sum. CoRR abs\/2112.11020 (2021). https:\/\/arxiv.org\/abs\/2112.11020"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21(2), 277\u2013292 (1974). https:\/\/doi.org\/10.1145\/321812.321823","journal-title":"J. ACM"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Jin, C., Wu, H.: A simple near-linear pseudopolynomial time randomized algorithm for subset sum. In: 2nd Symposium on Simplicity in Algorithms (SOSA 2019), vol. 69, pp. 17:1\u201317:6 (2018). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.17","DOI":"10.4230\/OASIcs.SOSA.2019.17"},{"key":"6_CR18","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0022-0000(03)00006-0","volume":"66","author":"H Kellerer","year":"2003","unstructured":"Kellerer, H., Mansini, R., Pferschy, U., Speranza, M.G.: An efficient fully polynomial approximation scheme for the subset-sum problem. J. Comput. Syst. Sci. 66(2), 349\u2013370 (2003). https:\/\/doi.org\/10.1016\/S0022-0000(03)00006-0","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Khan, M.A.: Some problems on graphs and arrangements of convex bodies (2017). https:\/\/doi.org\/10.11575\/PRISM\/10182","DOI":"10.11575\/PRISM\/10182"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/3329863","volume":"15","author":"K Koiliaris","year":"2019","unstructured":"Koiliaris, K., Xu, C.: Faster pseudopolynomial time algorithms for subset sum. ACM Trans. Algorithms 15(3), 401\u20134020 (2019). https:\/\/doi.org\/10.1145\/3329863","journal-title":"ACM Trans. Algorithms"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC-2004). pp. 125\u2013131. ACM, New York (2004). https:\/\/doi.org\/10.1145\/988772.988792","DOI":"10.1145\/988772.988792"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-319-94776-1_50","volume-title":"Computing and Combinatorics - 24th International Conference, COCOON 2018","author":"N Melissinos","year":"2018","unstructured":"Melissinos, N., Pagourtzis, A.: A faster FPTAS for the subset-sums ratio problem. In: Computing and Combinatorics - 24th International Conference, COCOON 2018. Lecture Notes in Computer Science, vol. 10976, pp. 602\u2013614. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_50"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-59901-0_9","volume-title":"Frontiers in Algorithmics","author":"N Melissinos","year":"2020","unstructured":"Melissinos, N., Pagourtzis, A., Triommatis, T.: Approximation schemes for subset sum ratio problems. In: Li, M. (ed.) FAW 2020. LNCS, vol. 12340, pp. 96\u2013107. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59901-0_9"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Mucha, M., Nederlof, J., Pawlewicz, J., Wegrzycki, K.: Equal-subset-sum faster than the meet-in-the-middle. In: 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, vol. 144, pp. 73:1\u201373:16 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.73","DOI":"10.4230\/LIPIcs.ESA.2019.73"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Mucha, M., Wegrzycki, K., Wlodarczyk, M.: A subquadratic approximation scheme for partition. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, 6\u20139 January 2019, pp. 70\u201388. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.5","DOI":"10.1137\/1.9781611975482.5"},{"issue":"19\u201321","key":"6_CR27","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ipl.2013.07.009","volume":"113","author":"D Nanongkai","year":"2013","unstructured":"Nanongkai, D.: Simple FPTAS for the subset-sums ratio problem. Inf. Process. Lett. 113(19\u201321), 750\u2013753 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.07.009","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"6_CR28","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80063-7","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1999.1034","volume":"33","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: Linear time algorithms for knapsack problems with bounded weights. J. Algorithms 33(1), 1\u201314 (1999). https:\/\/doi.org\/10.1006\/jagm.1999.1034","journal-title":"J. Algorithms"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"921","DOI":"10.12988\/ces.2017.79101","volume":"10","author":"N Voloch","year":"2017","unstructured":"Voloch, N.: Mssp for 2-d sets with unknown parameters and a cryptographic application. Contemp. Eng. Sci. 10, 921\u2013931 (2017). https:\/\/doi.org\/10.12988\/ces.2017.79101","journal-title":"Contemp. Eng. Sci."},{"issue":"6","key":"6_CR31","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0020-0190(92)90226-L","volume":"42","author":"GJ Woeginger","year":"1992","unstructured":"Woeginger, G.J., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42(6), 299\u2013302 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90226-L","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:05:51Z","timestamp":1653779151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}