{"id":"https://openalex.org/W2060502277","doi":"https://doi.org/10.1145/1378533.1378578","title":"A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster","display_name":"A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster","publication_year":2008,"publication_date":"2008-06-14","ids":{"openalex":"https://openalex.org/W2060502277","doi":"https://doi.org/10.1145/1378533.1378578","mag":"2060502277"},"language":"en","primary_location":{"id":"doi:10.1145/1378533.1378578","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378578","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-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/A5112269254","display_name":"Nedialko B. Dimitrov","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nedialko B. Dimitrov","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA","University of Texas at Austin, Austin, TX USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088504528","display_name":"Indrajit Roy","orcid":"https://orcid.org/0000-0002-4766-2664"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Indrajit Roy","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA","University of Texas at Austin, Austin, TX USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112269254"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.3812,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68237454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"236","last_page":"245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.996999979019165,"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/T11478","display_name":"Caching and Content Delivery","score":0.9951000213623047,"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/computer-science","display_name":"Computer science","score":0.7753982543945312},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.6585474610328674},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.510934054851532},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5016193389892578},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4473596215248108},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42390140891075134},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38635796308517456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15229737758636475}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7753982543945312},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.6585474610328674},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.510934054851532},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5016193389892578},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4473596215248108},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42390140891075134},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38635796308517456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15229737758636475},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1378533.1378578","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378578","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.561.531","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.561.531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://neddimitrov.org/uploads/pdfs/Dimitrov-FacilityLocationVariantConf.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W173758486","https://openalex.org/W1482186473","https://openalex.org/W1519454768","https://openalex.org/W1552828154","https://openalex.org/W1891203375","https://openalex.org/W1972868674","https://openalex.org/W1984034567","https://openalex.org/W2003719999","https://openalex.org/W2027725119","https://openalex.org/W2039224531","https://openalex.org/W2041645394","https://openalex.org/W2046554800","https://openalex.org/W2052494364","https://openalex.org/W2061594253","https://openalex.org/W2076746184","https://openalex.org/W2102969037","https://openalex.org/W2107390991","https://openalex.org/W2114360400","https://openalex.org/W2136442119","https://openalex.org/W2156887976","https://openalex.org/W2166590374","https://openalex.org/W2611804663","https://openalex.org/W3122099234","https://openalex.org/W3148765228","https://openalex.org/W4230573295","https://openalex.org/W4254220436","https://openalex.org/W4256361765","https://openalex.org/W6633003778","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W4285069850","https://openalex.org/W1974634278","https://openalex.org/W4240963716","https://openalex.org/W2891970004","https://openalex.org/W4301075503","https://openalex.org/W1596637634","https://openalex.org/W1996916724","https://openalex.org/W2321918740","https://openalex.org/W2900794160","https://openalex.org/W4288096837"],"abstract_inverted_index":{"In":[0],"this":[1,162],"paper":[2],"we":[3],"study":[4],"the":[5,39,50,54,65,103,117,129,138],"following":[6],"Cluster":[7,91,118],"Profit":[8,92,119],"Problem.":[9,106,120],"Highly":[10],"parallelizable":[11],"requests":[12],"are":[13],"present":[14],"on":[15,47,85,142],"some":[16,44],"network":[17,144],"nodes.":[18],"Each":[19],"request":[20,40,55],"is":[21,30,69,123,157,171],"associated":[22],"with":[23,137],"a":[24,48,72,98,124,143,148,158,182],"tuple":[25],"(g,":[26],"r).":[27],"The":[28,67,90],"requester":[29],"willing":[31],"to":[32,64,70,78,173],"pay":[33,53],"kg":[34],"if":[35,176],"k":[36],"machines":[37,45,51,77],"execute":[38],"in":[41],"parallel.":[42],"If":[43],"work":[46],"request,":[49],"must":[52],"processing":[56],"cost,":[57],"r,":[58],"as":[59,61,97],"well":[60],"connection":[62],"costs":[63,180],"request.":[66,89],"problem":[68],"find":[71],"profit":[73,99],"maximizing":[74,100],"assignment":[75],"of":[76,102],"requests,":[79],"such":[80],"that":[81,146,168],"each":[82],"machine":[83],"works":[84],"at":[86],"most":[87],"one":[88],"Problem":[93],"can":[94],"be":[95],"viewed":[96],"variant":[101],"Facility":[104],"Location":[105],"We":[107,133,153,165],"provide":[108],"and":[109],"analyze":[110],"an":[111],"algorithm":[112,136,140,156,170],"under":[113,161],"resource":[114,163],"augmentation":[115,122],"for":[116],"Resource":[121],"technique":[125],"made":[126],"famous":[127],"by":[128,181],"LRU":[130],"caching":[131],"analysis.":[132],"compare":[134],"our":[135,155,169],"optimal":[139],"operating":[141],"graph":[145],"has":[147],"constant":[149,159,183],"factor":[150],"longer":[151],"distances.":[152],"prove":[154],"approximation":[160],"augmentation.":[164],"also":[166],"show":[167],"resilient":[172],"group":[174],"deviations":[175],"deviating":[177],"increases":[178],"communication":[179],"factor.":[184]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}