{"id":"https://openalex.org/W2981373410","doi":"https://doi.org/10.1007/s00453-019-00643-z","title":"Dividing Splittable Goods Evenly and With Limited Fragmentation","display_name":"Dividing Splittable Goods Evenly and With Limited Fragmentation","publication_year":2019,"publication_date":"2019-10-25","ids":{"openalex":"https://openalex.org/W2981373410","doi":"https://doi.org/10.1007/s00453-019-00643-z","mag":"2981373410"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00643-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00643-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00643-z.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00643-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056718928","display_name":"Peter Damaschke","orcid":"https://orcid.org/0000-0003-4047-7594"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Damaschke","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296, G\u00f6teborg, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4047-7594","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056718928"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15287386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"82","issue":"5","first_page":"1298","last_page":"1328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9907000064849854,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.59412682056427},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38958507776260376}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.59412682056427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38958507776260376}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-019-00643-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00643-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00643-z.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:513743","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/513743","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00643-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00643-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00643-z.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321523","display_name":"Chalmers Tekniska H\u00f6gskola","ror":"https://ror.org/040wg7k59"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2981373410.pdf","grobid_xml":"https://content.openalex.org/works/W2981373410.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1182014237","https://openalex.org/W1482829220","https://openalex.org/W1517036688","https://openalex.org/W1929368808","https://openalex.org/W1992734168","https://openalex.org/W1996641400","https://openalex.org/W2011039300","https://openalex.org/W2014071862","https://openalex.org/W2021459465","https://openalex.org/W2026891055","https://openalex.org/W2034931448","https://openalex.org/W2065011764","https://openalex.org/W2066369985","https://openalex.org/W2073006754","https://openalex.org/W2093979815","https://openalex.org/W2110486028","https://openalex.org/W2235753326","https://openalex.org/W2525309838","https://openalex.org/W2541841001","https://openalex.org/W2561675875","https://openalex.org/W2964074389","https://openalex.org/W3100569302","https://openalex.org/W4210637083","https://openalex.org/W4236127247","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"splittable":[2],"good":[3],"provided":[4],"in":[5,61,75,93,99,113,116,129,180,206],"n":[6,214,216],"pieces":[7],"shall":[8,163],"be":[9,97,164],"divided":[10],"as":[11,13,169],"evenly":[12],"possible":[14],"among":[15],"m":[16,209],"agents,":[17],"where":[18,160],"every":[19],"agent":[20],"can":[21,96],"take":[22],"shares":[23],"from":[24,188],"at":[25],"most":[26],"F":[27,31],"pieces.":[28],"We":[29,183],"call":[30],"the":[32,39,54,88,124,130,141,146,172,177],"fragmentation":[33,194],"and":[34,44,56,72,108,202],"mainly":[35],"restrict":[36],"attention":[37],"to":[38,118,166,170,198,212],"cases":[40,207],"$$F=1$$":[41,50,119],"<mml:math":[42,46,51,67,105,120,133,150,196],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math>":[43,52,121],"$$F=2$$":[45,66,195],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math>":[47,68,197],".":[48,122,135],"For":[49],",":[53,107],"max\u2013min":[55],"min\u2013max":[57],"problems":[58],"are":[59],"solvable":[60],"linear":[62,100],"time.":[63],"The":[64,153],"case":[65],"has":[69],"neat":[70],"formulations":[71],"structural":[73,154],"characterizations":[74],"terms":[76],"of":[77,143],"weighted":[78],"graphs.":[79],"First":[80],"we":[81],"focus":[82],"on":[83],"perfectly":[84],"balanced":[85],"solutions.":[86],"While":[87],"problem":[89,125,159,192],"is":[90,126,210],"strongly":[91],"NP-hard":[92],"general,":[94],"it":[95],"solved":[98],"time":[101],"if":[102],"$$m\\ge":[103],"n-1$$":[104],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mi>m</mml:mi><mml:mo>\u2265</mml:mo><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math>":[106],"a":[109],"solution":[110],"always":[111],"exists":[112],"this":[114,138,199],"case,":[115],"contrast":[117],"Moreover,":[123],"fixed-parameter":[127],"tractable":[128],"parameter":[131,139],"$$2m-n$$":[132],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mn>2</mml:mn><mml:mi>m</mml:mi><mml:mo>-</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math>":[134],"(Note":[136],"that":[137],"measures":[140],"number":[142],"agents":[144],"above":[145],"trivial":[147],"threshold":[148],"$$m=n/2$$":[149],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mi>n</mml:mi><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math>":[151],".)":[152],"results":[155,205],"suggest":[156],"another":[157],"related":[158],"unsplittable":[161],"items":[162],"assigned":[165],"subsets":[167],"so":[168],"balance":[171],"average":[173],"sizes":[174],"(rather":[175],"than":[176],"total":[178],"sizes)":[179],"these":[181],"subsets.":[182],"give":[184],"an":[185],"approximation-preserving":[186],"reduction":[187],"our":[189],"original":[190],"splitting":[191],"with":[193],"averaging":[200],"problem,":[201],"some":[203],"approximation":[204],"when":[208],"close":[211],"either":[213],"or":[215],"/":[217],"2.":[218]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}