{"id":"https://openalex.org/W4417414857","doi":"https://doi.org/10.4230/lipics.isaac.2025.44","title":"Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio","display_name":"Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4417414857","doi":"https://doi.org/10.4230/lipics.isaac.2025.44"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2503.18241","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.18241","pdf_url":"https://arxiv.org/pdf/2503.18241","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2503.18241","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092231004","display_name":"Sotiris Kanellopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Kanellopoulos, Sotiris","raw_affiliation_strings":["National Technical University of Athens and Archimedes, Athena Research Center, Greece"],"raw_orcid":"https://orcid.org/0009-0006-2999-0580","affiliations":[{"raw_affiliation_string":"National Technical University of Athens and Archimedes, Athena Research Center, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053190888","display_name":"Giorgos Mitropoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Mitropoulos, Giorgos","raw_affiliation_strings":["National Technical University of Athens and Archimedes, Athena Research Center, Greece"],"raw_orcid":"https://orcid.org/0009-0000-0479-263X","affiliations":[{"raw_affiliation_string":"National Technical University of Athens and Archimedes, Athena Research Center, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081297062","display_name":"Antonis Antonopoulos","orcid":"https://orcid.org/0000-0002-1368-6334"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Antonopoulos, Antonis","raw_affiliation_strings":["National Technical University of Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0002-1368-6334","affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044456685","display_name":"Nikos Leonardos","orcid":"https://orcid.org/0000-0003-3909-7914"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Leonardos, Nikos","raw_affiliation_strings":["National Technical University of Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0003-3909-7914","affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091546742","display_name":"Aris Pagourtzis","orcid":"https://orcid.org/0000-0002-6220-3722"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Pagourtzis, Aris","raw_affiliation_strings":["National Technical University of Athens and Archimedes, Athena Research Center, Greece"],"raw_orcid":"https://orcid.org/0000-0002-6220-3722","affiliations":[{"raw_affiliation_string":"National Technical University of Athens and Archimedes, Athena Research Center, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119981656","display_name":"Christos Pergaminelis","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Pergaminelis, Christos","raw_affiliation_strings":["National Technical University of Athens and Archimedes, Athena Research Center, Greece"],"raw_orcid":"https://orcid.org/0009-0009-8981-3676","affiliations":[{"raw_affiliation_string":"National Technical University of Athens and Archimedes, Athena Research Center, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080468106","display_name":"Stavros Petsalakis","orcid":"https://orcid.org/0000-0001-7825-2839"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Petsalakis, Stavros","raw_affiliation_strings":["National Technical University of Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0001-7825-2839","affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120829074","display_name":"Kanellos Tsitouras","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Tsitouras, Kanellos","raw_affiliation_strings":["National Technical University of Athens, Greece"],"raw_orcid":"https://orcid.org/0009-0003-5645-7931","affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5092231004"],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38133843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5375000238418579,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5375000238418579,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0737999975681305,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.061799999326467514,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.829800009727478},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.7342000007629395},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5781000256538391},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5192000269889832},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4607999920845032},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4047999978065491},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4004000127315521},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.34619998931884766}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.829800009727478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7728999853134155},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.7342000007629395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6764000058174133},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5781000256538391},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5192000269889832},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47620001435279846},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4047999978065491},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4004000127315521},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3222000002861023},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.2939000129699707},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C18802822","wikidata":"https://www.wikidata.org/wiki/Q41690","display_name":"Golden ratio","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C2776436304","wikidata":"https://www.wikidata.org/wiki/Q30693829","display_name":"Density ratio","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2624000012874603},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.2574000060558319},{"id":"https://openalex.org/C86024645","wikidata":"https://www.wikidata.org/wiki/Q6795632","display_name":"Maximal-ratio combining","level":4,"score":0.25459998846054077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25279998779296875}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2503.18241","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.18241","pdf_url":"https://arxiv.org/pdf/2503.18241","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:24952","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.44","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/LIPIcs.ISAAC.2025.44/LIPIcs.ISAAC.2025.44.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.48550/arxiv.2503.18241","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2503.18241","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.isaac.2025.44","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.isaac.2025.44","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2503.18241","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.18241","pdf_url":"https://arxiv.org/pdf/2503.18241","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6276162139","display_name":null,"funder_award_id":"MIS 5154714","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Subset":[1],"Sum":[2,42],"Ratio":[3,43,102],"problem":[4,121,164],"(SSR)":[5],"asks,":[6],"given":[7],"a":[8,116,144,192,215,233],"multiset":[9],"$A$":[10,20],"of":[11,19,26,38,52,54,58,82,118,128,137,176,179,186,236],"positive":[12],"integers,":[13],"to":[14,47,125,160,225],"find":[15],"two":[16],"disjoint":[17,56],"subsets":[18,57,113],"such":[21],"that":[22,110],"the":[23,36,49,76,80,87,98,111,126,130,135,161,174,184,196,226,229],"largest-to-smallest":[24,50,131],"ratio":[25,51,133],"their":[27],"sums":[28,53],"is":[29,75,86,157],"minimized.":[30],"In":[31],"this":[32,85,120],"paper":[33],"we":[34,213],"study":[35,97],"$k$-version":[37],"SSR,":[39],"namely":[40],"$k$-Subset":[41],"($k$-SSR),":[44],"which":[45,105,169,220],"asks":[46],"minimize":[48],"$k$":[55,112],"$A$.":[59],"We":[60,95,142],"develop":[61],"an":[62],"approximation":[63],"scheme":[64,231],"for":[65,90,92,148,183,205,218],"$k$-SSR":[66,91,108],"running":[67],"in":[68,109,122,134,173],"$O({n^{2k}}/{\\varepsilon^{k-1}})$":[69,152],"time,":[70],"where":[71],"$n=|A|$":[72],"and":[73,202],"$\\varepsilon$":[74],"error":[77],"parameter.":[78],"To":[79],"best":[81],"our":[83,189],"knowledge,":[84],"first":[88,227],"FPTAS":[89,147,190,204,217],"fixed":[93],"$k>2$.":[94],"also":[96,150,158],"$k$-way":[99],"Number":[100,139],"Partitioning":[101,140],"($k$-PART)":[103],"problem,":[104],"differs":[106],"from":[107],"must":[114],"constitute":[115],"partition":[117],"$A$;":[119],"fact":[123],"corresponds":[124],"objective":[127],"minimizing":[129],"sum":[132],"family":[136],"Multiway":[138],"problems.":[141],"present":[143],"more":[145],"involved":[146],"$k$-PART,":[149],"achieving":[151],"time":[153,234],"complexity.":[154],"Notably,":[155],"$k$-PART":[156],"equivalent":[159],"Minimum":[162,206],"Envy-Ratio":[163,207],"with":[165,208],"identical":[166,187],"valuation":[167],"functions,":[168],"has":[170,232],"been":[171],"studied":[172],"context":[175],"fair":[177],"division":[178],"indivisible":[180],"goods.":[181],"Thus,":[182],"case":[185],"valuations,":[188],"represents":[191],"significant":[193],"improvement":[194],"over":[195],"$O(n^{4k^2+1}/\\varepsilon^{2k^2})$":[197],"bound":[198],"obtained":[199],"by":[200],"Nguyen":[201],"Rothe's":[203],"general":[209],"additive":[210],"valuations.":[211],"Lastly,":[212],"propose":[214],"second":[216],"$k$-SSR,":[219],"employs":[221],"carefully":[222],"designed":[223],"calls":[224],"one;":[228],"new":[230],"complexity":[235],"$\\widetilde{O}(n/{\\varepsilon^{3k-1}})$,":[237],"thus":[238],"being":[239],"much":[240],"faster":[241],"when":[242],"$n\\gg":[243],"1/":[244],"\\varepsilon$.":[245]},"counts_by_year":[],"updated_date":"2025-12-17T05:08:17.603714","created_date":"2025-10-10T00:00:00"}