{"id":"https://openalex.org/W2018682510","doi":"https://doi.org/10.1137/080715421","title":"Approximation Algorithms for Data Placement Problems","display_name":"Approximation Algorithms for Data Placement Problems","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2018682510","doi":"https://doi.org/10.1137/080715421","mag":"2018682510"},"language":"en","primary_location":{"id":"doi:10.1137/080715421","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080715421","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040469157","display_name":"Ivan D. Baev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ivan Baev","raw_affiliation_strings":["ivan.baev@hp.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ivan.baev@hp.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103525476","display_name":"Rajmohan Rajaraman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajmohan Rajaraman","raw_affiliation_strings":["rraj@ccs.neu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"rraj@ccs.neu.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031968426","display_name":"Chaitanya Swamy","orcid":"https://orcid.org/0000-0003-1108-7941"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chaitanya Swamy","raw_affiliation_strings":["cswamy@math.uwaterloo.ca#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"cswamy@math.uwaterloo.ca#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.1615,"has_fulltext":false,"cited_by_count":221,"citation_normalized_percentile":{"value":0.97067901,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"38","issue":"4","first_page":"1411","last_page":"1429"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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.9979000091552734,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8177527785301208},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7988649606704712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7477848529815674},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5863521695137024},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.564858078956604},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5633399486541748},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.513100266456604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45100441575050354},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4352525472640991},{"id":"https://openalex.org/keywords/data-access","display_name":"Data access","score":0.4323725700378418},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4231809973716736},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3490118682384491},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3446364104747772},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.22856605052947998},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07791951298713684}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8177527785301208},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7988649606704712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7477848529815674},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5863521695137024},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.564858078956604},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5633399486541748},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.513100266456604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45100441575050354},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4352525472640991},{"id":"https://openalex.org/C47487241","wikidata":"https://www.wikidata.org/wiki/Q5227230","display_name":"Data access","level":2,"score":0.4323725700378418},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4231809973716736},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3490118682384491},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3446364104747772},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.22856605052947998},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07791951298713684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080715421","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080715421","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W1508746608","https://openalex.org/W1591004461","https://openalex.org/W1755312702","https://openalex.org/W1966016308","https://openalex.org/W1966079129","https://openalex.org/W1972442117","https://openalex.org/W1973529814","https://openalex.org/W1978117135","https://openalex.org/W1980350908","https://openalex.org/W1981730822","https://openalex.org/W1985510066","https://openalex.org/W1989289072","https://openalex.org/W1991407520","https://openalex.org/W1993553863","https://openalex.org/W2006514056","https://openalex.org/W2007513370","https://openalex.org/W2014369282","https://openalex.org/W2014811898","https://openalex.org/W2026102701","https://openalex.org/W2029828838","https://openalex.org/W2029933769","https://openalex.org/W2044277517","https://openalex.org/W2048854555","https://openalex.org/W2051169745","https://openalex.org/W2052494364","https://openalex.org/W2058267344","https://openalex.org/W2062686411","https://openalex.org/W2064107965","https://openalex.org/W2080697418","https://openalex.org/W2085751730","https://openalex.org/W2094410510","https://openalex.org/W2098081223","https://openalex.org/W2101622070","https://openalex.org/W2107144517","https://openalex.org/W2107483781","https://openalex.org/W2109549136","https://openalex.org/W2111622175","https://openalex.org/W2112112676","https://openalex.org/W2113795328","https://openalex.org/W2114086213","https://openalex.org/W2115365534","https://openalex.org/W2138063976","https://openalex.org/W2138816444","https://openalex.org/W2139841919","https://openalex.org/W2144926522","https://openalex.org/W2147670675","https://openalex.org/W2147879413","https://openalex.org/W2149106399","https://openalex.org/W2150512594","https://openalex.org/W2161908970","https://openalex.org/W2165303918","https://openalex.org/W2167874810","https://openalex.org/W2608158342","https://openalex.org/W3148765228","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2230311946","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W1600160158","https://openalex.org/W2137277194","https://openalex.org/W3175189485","https://openalex.org/W4287593987","https://openalex.org/W2561769964","https://openalex.org/W4287552035","https://openalex.org/W3112213682"],"abstract_inverted_index":{"We":[0,39,49,163,213,243,292,300],"develop":[1],"approximation":[2],"algorithms":[3,304],"for":[4,21,27,84,168,229,264,297],"the":[5,15,35,41,136,142,156,186,190,200,210,216,286,313,326,345,349],"problem":[6,44,220],"of":[7,53,58,64,113,126,135,148,185,189,241,288,312,328,348],"placing":[8],"replicated":[9],"data":[10,22,29,42,65,76,87,137,218,230],"in":[11,106,209,352],"arbitrary":[12],"networks,":[13],"where":[14,224,319,340],"nodes":[16],"may":[17,331],"both":[18],"issue":[19],"requests":[20],"objects":[23,30,66,138,341,350],"and":[24,61,90,115,145,159,336,344],"have":[25,50,342],"capacity":[26,143],"storing":[28],"so":[31,152,232],"as":[32,153],"to":[33,45,92,95,119,131,139,150,154,180,198,221,238,261,275,308],"minimize":[34,155],"average":[36],"data-access":[37],"cost.":[38,212],"introduce":[40,215],"placement":[43,134,219],"model":[46,244],"this":[47,169,245,298],"problem.":[48,170,187,299],"a":[51,56,62,85,96,110,133,165,181,206,236,252,258,262,269,273,294,316,322,333,338],"set":[52,57,63],"caches":[54,140,151,250,329],"$\\mathcal{F}$,":[55],"clients":[59,149],"$\\mathcal{D}$,":[60],"$\\mathcal{O}$.":[67],"Each":[68,78],"cache":[69,97,107,120,201,354],"i":[70,108,121],"can":[71,305],"store":[72],"at":[73],"most":[74],"$u_i$":[75],"objects.":[77],"client":[79,117,160],"$j\\in\\mathcal{D}$":[80],"has":[81,91],"demand":[82],"$d_j$":[83],"specific":[86],"object":[88,104,254],"$o(j)\\in\\mathcal{O}$":[89],"be":[93,255,306],"assigned":[94],"that":[98,100,233,248,265,279,302,330],"stores":[99],"object.":[101,280],"Storing":[102],"an":[103,123,146,177],"o":[105],"incurs":[109,122],"storage":[111,158],"cost":[112,125,283,287],"$f_i^o$,":[114],"assigning":[116],"j":[118],"access":[124,161],"$d_jc_{ij}$.":[127],"The":[128,281],"goal":[129],"is":[130,173,197,321],"find":[132],"respecting":[141],"constraints,":[144],"assignment":[147],"total":[157,282,346],"costs.":[162],"present":[164],"10-approximation":[166],"algorithm":[167,172,296],"Our":[171],"based":[174],"on":[175,325],"rounding":[176,196],"optimal":[178],"solution":[179,211],"natural":[182],"linear-programming":[183],"relaxation":[184],"One":[188],"main":[191],"technical":[192],"challenges":[193],"encountered":[194],"during":[195],"preserve":[199],"capacities":[202],"while":[203],"incurring":[204],"only":[205],"constant-factor":[207],"increase":[208],"also":[214,227],"connected":[217,256],"capture":[222],"settings":[223],"write-requests":[225],"are":[226],"issued":[228],"objects,":[231],"one":[234],"requires":[235],"mechanism":[237],"maintain":[239],"consistency":[240],"data.":[242],"by":[246,257],"requiring":[247],"all":[249],"containing":[251],"given":[253,334],"Steiner":[259,290],"tree":[260],"root":[263],"object,":[266,335],"which":[267],"issues":[268],"multicast":[270],"message":[271],"upon":[272],"write":[274],"(any":[276],"copy":[277],"of)":[278],"now":[284],"includes":[285],"these":[289],"trees.":[291],"devise":[293],"14-approximation":[295],"show":[301],"our":[303],"adapted":[307],"handle":[309],"two":[310],"variants":[311],"problem:":[314],"(a)":[315],"k-median":[317],"variant,":[318],"there":[320],"specified":[323],"bound":[324],"number":[327],"contain":[332],"(b)":[337],"generalization":[339],"lengths":[343],"length":[347],"stored":[351],"any":[353],"must":[355],"not":[356],"exceed":[357],"its":[358],"capacity.":[359]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":28},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":14}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}