{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:06:11Z","timestamp":1743095171611,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030599003"},{"type":"electronic","value":"9783030599010"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59901-0_9","type":"book-chapter","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T08:02:41Z","timestamp":1600761761000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Schemes for Subset Sum Ratio Problems"],"prefix":"10.1007","author":[{"given":"Nikolaos","family":"Melissinos","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Theofilos","family":"Triommatis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,23]]},"reference":[{"issue":"2","key":"9_CR1","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":"9_CR2","unstructured":"Chan, T.M.: Approximation schemes for 0-1 knapsack. In: SOSA 2018, pp. 5:1\u20135:12 (2018)"},{"key":"9_CR3","series-title":"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.: Measurement errors make the partial digest problem NP-hard. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 379\u2013390. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_42"},{"key":"9_CR4","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","author":"M Cieliebak","year":"2003","unstructured":"Cieliebak, M., Eidenbenz, S., Penna, P.: Noisy data make the partial digest problem NP-hard. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS, vol. 2812, pp. 111\u2013123. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39763-2_9"},{"key":"9_CR5","unstructured":"Cieliebak, M., Eidenbenz, S., Pagourtzis, A., Schlude, K.: Equal sum subsets: complexity of variations. Technical report 370. ETH Z\u00fcrich, Department of Computer Science (2003)"},{"key":"9_CR6","series-title":"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., Pagourtzis, A.: Composing equipotent teams. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 98\u2013108. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45077-1_10"},{"issue":"3","key":"9_CR7","first-page":"151","volume":"14","author":"M Cieliebak","year":"2008","unstructured":"Cieliebak, M., Eidenbenz, S., Pagourtzis, A., Schlude, K.: On the complexity of variations of equal sum subsets. Nordic J. Comput. 14(3), 151\u2013172 (2008)","journal-title":"Nordic J. Comput."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s10878-018-0262-1","volume":"36","author":"L Gourv\u00e8s","year":"2018","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Subset sum problems with digraph constraints. J. Comb. Optim. 36(3), 937\u2013964 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0262-1","journal-title":"J. Comb. Optim."},{"issue":"2","key":"9_CR9","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"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23(2), 317\u2013327 (1976). https:\/\/doi.org\/10.1145\/321941.321951","journal-title":"J. ACM"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463\u2013468 (1975). https:\/\/doi.org\/10.1145\/321906.321909","journal-title":"J. ACM"},{"issue":"1\u201376","key":"9_CR12","first-page":"14","volume":"76","author":"C Jin","year":"2019","unstructured":"Jin, C.: An improved FPTAS for 0-1 knapsack. ICALP 76(1\u201376), 14 (2019)","journal-title":"ICALP"},{"key":"9_CR13","unstructured":"Khan, M.A.: Some problems on graphs and arrangements of convex bodies. Ph.D. thesis, University of Calgary (2017). https:\/\/prism.ucalgary.ca\/handle\/11023\/3765"},{"key":"9_CR14","doi-asserted-by":"crossref","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), New York, NY, USA, 17\u201320 May 2004, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"9_CR15","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","author":"N Melissinos","year":"2018","unstructured":"Melissinos, N., Pagourtzis, A.: A faster FPTAS for the subset-sums ratio problem. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 602\u2013614. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_50"},{"issue":"1\u201373","key":"9_CR16","first-page":"16","volume":"73","author":"M Mucha","year":"2019","unstructured":"Mucha, M., Nederlof, J., Pawlewicz, J., Wegrzycki, K.: Equal-subset-sum faster than the meet-in-the-middle. ESA 73(1\u201373), 16 (2019)","journal-title":"ESA"},{"issue":"19\u201321","key":"9_CR17","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)","journal-title":"Inf. Process. Lett."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"498532","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, 498532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.tcs.2007.03.006","volume":"382","author":"K Pruhs","year":"2007","unstructured":"Pruhs, K., Woeginger, G.J.: Approximation schemes for a class of subset selection problems. Theoret. Comput. Sci. 382(2), 151\u2013156 (2007). https:\/\/dblp.org\/rec\/bib\/journals\/tcs\/PruhsW07","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116\u2013127 (1976). https:\/\/dblp.org\/rec\/bib\/journals\/jacm\/Sahni76","journal-title":"J. ACM"},{"issue":"19","key":"9_CR21","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(19), 921\u2013931 (2017)","journal-title":"Contemp. Eng. Sci."},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. 12(1), 57\u201374 (2000). https:\/\/doi.org\/10.1287\/ijoc.12.1.57.11901","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"9_CR23","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","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59901-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T16:04:44Z","timestamp":1619280284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59901-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030599003","9783030599010"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59901-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haikou","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/faw2020\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","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":"12","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":"80% - 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":"1.5","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}