{"id":"https://openalex.org/W7160145821","doi":"https://doi.org/10.48550/arxiv.2605.00209","title":"Replication in Graph Partitioning and Scheduling Problems","display_name":"Replication in Graph Partitioning and Scheduling Problems","publication_year":2026,"publication_date":"2026-04-30","ids":{"openalex":"https://openalex.org/W7160145821","doi":"https://doi.org/10.48550/arxiv.2605.00209"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.00209","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.00209","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.00209","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051660284","display_name":"P\u00e1l Andr\u00e1s Papp","orcid":"https://orcid.org/0009-0005-6667-802X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Papp, P\u00e1l Andr\u00e1s","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135280839","display_name":"Toni B\u00f6hnlein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B\u00f6hnlein, Toni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088965695","display_name":"A. N. Yzelman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yzelman, A. N.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.5164999961853027,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.5164999961853027,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.2653999924659729,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.09160000085830688,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/scheduling","display_name":"Scheduling (production processes)","score":0.6481000185012817},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46970000863075256},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4487999975681305},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44339999556541443},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.43810001015663147},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43299999833106995},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.4260999858379364},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.420199990272522},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4090000092983246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7800999879837036},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6481000185012817},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46970000863075256},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44339999556541443},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44040000438690186},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.43810001015663147},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43299999833106995},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4113999903202057},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3871999979019165},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.3684000074863434},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.35040000081062317},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27480000257492065},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25699999928474426},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.00209","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.00209","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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.00209","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.00209","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"efficient":[1],"parallel":[2],"execution":[3],"of":[4,35,92,95,120,142,153,228],"complex":[5],"computations":[6],"requires":[7],"balancing":[8],"the":[9,15,33,70,81,93,103,114,134,143,170,180,190],"workload":[10],"across":[11],"processors":[12,62],"while":[13,78],"minimizing":[14],"communication":[16,82,193],"between":[17],"them.":[18],"This":[19],"inherent":[20],"trade-off":[21],"is":[22,86,213],"often":[23],"captured":[24],"by":[25,74,147,182],"graph":[26,110],"partitioning":[27,98],"or":[28,186,232],"DAG":[29,198],"scheduling":[30,100],"problems.":[31,101],"For":[32,158,197],"sake":[34],"model":[36],"simplicity,":[37],"most":[38],"works":[39],"on":[40,60,97,128,149,184,204],"these":[41],"problems":[42],"assume":[43],"that":[44,108,176,212],"nodes":[45],"can":[46,63,178],"be":[47,65],"assigned":[48],"to":[49,87,168,216,235],"only":[50,73],"a":[51,75,89,139,150,209,224],"single":[52],"processor.":[53],"However,":[54],"in":[55,118,194,237],"reality,":[56],"replicating":[57],"an":[58],"operation":[59],"several":[61],"easily":[64],"beneficial:":[66],"it":[67],"may":[68],"increase":[69],"computational":[71],"costs":[72],"small":[76],"amount,":[77],"significantly":[79,116],"reducing":[80],"requirements.":[83],"Our":[84,220],"goal":[85],"provide":[88],"comprehensive":[90],"analysis":[91,141],"impact":[94,127],"replication":[96,112,177],"and":[99,207],"On":[102,133],"theoretical":[104],"side,":[105,136],"we":[106,137,161,200],"show":[107,175],"for":[109,124,192],"partitioning,":[111,160],"makes":[113],"problem":[115],"harder":[117],"terms":[119],"approximation":[121],"complexity,":[122],"whereas":[123],"scheduling,":[125,199],"its":[126],"complexity":[129],"seems":[130],"less":[131],"prominent.":[132],"experimental":[135],"conduct":[138],"thorough":[140],"cost":[144,181,226],"reduction":[145,227],"obtainable":[146],"replication,":[148,231],"wide":[151],"range":[152],"graphs":[154],"from":[155],"real-world":[156],"applications.":[157],"hypergraph":[159],"use":[162,202],"Integer":[163],"Linear":[164],"Programming":[165],"(ILP)":[166],"formulations":[167],"compare":[169],"optimal":[171],"costs;":[172],"our":[173],"experiments":[174,221],"reduce":[179],"17%-65%":[183],"average,":[185],"even":[187,233],"entirely":[188],"remove":[189],"need":[191],"some":[195,238],"cases.":[196,239],"similarly":[201],"ILPs":[203],"smaller":[205],"graphs,":[206],"develop":[208],"sophisticated":[210],"heuristic":[211],"also":[214],"applicable":[215],"much":[217],"larger":[218],"workloads.":[219],"here":[222],"demonstrate":[223],"mean":[225],"11.61%-23.13%":[229],"with":[230],"up":[234],"58.17%":[236]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-05T00:00:00"}