{"id":"https://openalex.org/W2175640098","doi":"https://doi.org/10.1007/s00453-007-9118-2","title":"Combinatorial Algorithms for Data Migration to Minimize Average Completion Time","display_name":"Combinatorial Algorithms for Data Migration to Minimize Average Completion Time","publication_year":2007,"publication_date":"2007-11-13","ids":{"openalex":"https://openalex.org/W2175640098","doi":"https://doi.org/10.1007/s00453-007-9118-2","mag":"2175640098"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9118-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9118-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9118-2.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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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-007-9118-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015765462","display_name":"Rajiv Gandhi","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Gandhi","raw_affiliation_strings":["Department of Computer Science, Rutgers University-Camden, Camden, NJ, 08102, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, NJ, 08102, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007528822","display_name":"Juli\u00e1n Mestre","orcid":"https://orcid.org/0000-0003-4948-2998"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Juli\u00e1n Mestre","raw_affiliation_strings":["Max-Planck-Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007528822"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.3464,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.84419662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"54","issue":"1","first_page":"54","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.998199999332428,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6676218509674072},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6315059661865234},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6158315539360046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5758621692657471},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5454874038696289},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5302053689956665},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.506362795829773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4909379780292511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4607987701892853},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43468907475471497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4128260314464569},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32326388359069824},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31631404161453247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17845216393470764}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6676218509674072},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6315059661865234},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6158315539360046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5758621692657471},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5454874038696289},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5302053689956665},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.506362795829773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4909379780292511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4607987701892853},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43468907475471497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4128260314464569},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32326388359069824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31631404161453247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17845216393470764},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-007-9118-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9118-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9118-2.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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:edoc.mpg.de:518347","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518347","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, v.54, 54-71 (2009)","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s00453-007-9118-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9118-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9118-2.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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.75,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G2871121585","display_name":"Techniques in Approximation Algorithms","funder_award_id":"0430650","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7274839687","display_name":"ITR/SY: Algorithms for Data Storage and Movement","funder_award_id":"0113192","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333987","display_name":"Research Council, Rutgers, The State University of New Jersey","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2175640098.pdf","grobid_xml":"https://content.openalex.org/works/W2175640098.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1531537174","https://openalex.org/W1531908439","https://openalex.org/W1550742790","https://openalex.org/W1584086379","https://openalex.org/W1668808034","https://openalex.org/W1960330418","https://openalex.org/W1974098993","https://openalex.org/W1975611596","https://openalex.org/W1978007997","https://openalex.org/W1980334956","https://openalex.org/W1982587787","https://openalex.org/W1997370889","https://openalex.org/W2012711355","https://openalex.org/W2013639761","https://openalex.org/W2014528617","https://openalex.org/W2029872107","https://openalex.org/W2039409351","https://openalex.org/W2075265959","https://openalex.org/W2089269509","https://openalex.org/W2090986925","https://openalex.org/W2105922921","https://openalex.org/W2111167597","https://openalex.org/W2114711248","https://openalex.org/W2120729889","https://openalex.org/W2139534004","https://openalex.org/W2148204686","https://openalex.org/W2170050590"],"related_works":["https://openalex.org/W9203110","https://openalex.org/W2379188955","https://openalex.org/W2757966824","https://openalex.org/W2072291569","https://openalex.org/W2098538883","https://openalex.org/W3047485772","https://openalex.org/W1712180277","https://openalex.org/W2056597184","https://openalex.org/W1608414128","https://openalex.org/W2081642962"],"abstract_inverted_index":{"The":[0,86],"data":[1,12,40,160],"migration":[2,161],"problem":[3,162],"is":[4,25,73,88,154,168,173,219],"to":[5,22,89,174],"compute":[6],"an":[7,107,190],"efficient":[8,121],"plan":[9],"for":[10],"moving":[11],"stored":[13],"on":[14,68,78],"devices":[15],"in":[16,163],"a":[17,28,50,57,119,138,145,155,185],"network":[18],"from":[19],"one":[20],"configuration":[21],"another.":[23],"It":[24],"modeled":[26],"by":[27,201],"transfer":[29,166],"graph,":[30],"where":[31],"vertices":[32],"represent":[33,39],"the":[34,65,71,79,91,126,148,159,165,171,176,198,214],"storage":[35],"devices,":[36],"and":[37,53,170],"edges":[38,66,76,112,131],"transfers":[41],"required":[42],"between":[43],"pairs":[44],"of":[45,93,97,147,158,178,181,193,216],"devices.":[46],"Each":[47],"vertex":[48,61,81],"has":[49,56],"non-negative":[51],"weight,":[52],"each":[54],"edge":[55],"processing":[58,115,134],"time.":[59],"A":[60],"completes":[62],"when":[63,111],"all":[64,98],"incident":[67,77],"it":[69],"complete;":[70],"constraint":[72],"that":[74,124,188,213],"two":[75],"same":[80,127],"cannot":[82],"be":[83],"processed":[84],"simultaneously.":[85],"objective":[87,172],"minimize":[90,175],"sum":[92,177],"weighted":[94],"completion":[95,179],"times":[96,135,180],"vertices.":[99],"Kim":[100],"(J.":[101],"Algorithms":[102,207],"55,":[103],"42\u201357,":[104],"2005)":[105],"gave":[106],"LP-rounding":[108],"3-approximation":[109],"algorithm":[110,123,187,218],"have":[113,132],"unit":[114],"times.":[116],"We":[117,142,183,211],"give":[118,137],"more":[120],"primal-dual":[122,139],"achieves":[125,189],"approximation":[128,191],"guarantee.":[129],"When":[130],"arbitrary":[133],"we":[136],"5.83-approximation":[140],"algorithm.":[141],"also":[143],"study":[144],"variant":[146],"open":[149],"shop":[150],"scheduling":[151],"problem.":[152],"This":[153],"special":[156],"case":[157],"which":[164],"graph":[167],"bipartite":[169],"edges.":[182],"present":[184],"simple":[186],"ratio":[192],"$\\sqrt{2}\\approx1.414$":[194],",":[195],"thus":[196],"improving":[197],"1.796-approximation":[199],"given":[200],"Gandhi":[202],"et":[203],"al.":[204],"(ACM":[205],"Trans.":[206],"2(1),":[208],"116\u2013129,":[209],"2006).":[210],"show":[212],"analysis":[215],"our":[217],"almost":[220],"tight.":[221]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}