{"id":"https://openalex.org/W2127015767","doi":"https://doi.org/10.1145/1066677.1066844","title":"A solution for the location problem in arbitrary computer networks using generic dominating sets","display_name":"A solution for the location problem in arbitrary computer networks using generic dominating sets","publication_year":2005,"publication_date":"2005-03-13","ids":{"openalex":"https://openalex.org/W2127015767","doi":"https://doi.org/10.1145/1066677.1066844","mag":"2127015767"},"language":"en","primary_location":{"id":"doi:10.1145/1066677.1066844","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt2gw8c5ww/qt2gw8c5ww.pdf?t=qmk65x","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050130606","display_name":"Marco Aur\u00e9lio Spohn","orcid":"https://orcid.org/0000-0002-9265-9421"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marco Aur\u00e9lio Spohn","raw_affiliation_strings":["University of California at Santa Cruz, Santa Cruz, CA","University of California at Santa Cruz, Santa Cruz, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of California at Santa Cruz, Santa Cruz, CA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"University of California at Santa Cruz, Santa Cruz, CA#TAB#","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. J. Garcia-Luna-Aceves","raw_affiliation_strings":["University of California at Santa Cruz, Santa Cruz, CA","University of California at Santa Cruz, Santa Cruz, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of California at Santa Cruz, Santa Cruz, CA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"University of California at Santa Cruz, Santa Cruz, CA#TAB#","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050130606"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20487691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"739","last_page":"743"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9988999962806702,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9988999962806702,"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.9957000017166138,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9944999814033508,"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/dominating-set","display_name":"Dominating set","score":0.917540431022644},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.668248176574707},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5274301171302795},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5269349813461304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5219444632530212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.516409695148468},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4939442276954651},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48494938015937805},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.46921172738075256},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45276913046836853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4365870952606201},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4269057512283325},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4014691710472107},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12092509865760803}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.917540431022644},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.668248176574707},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5274301171302795},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5269349813461304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5219444632530212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.516409695148468},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4939442276954651},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48494938015937805},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.46921172738075256},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45276913046836853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4365870952606201},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4269057512283325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4014691710472107},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12092509865760803},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1066677.1066844","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt2gw8c5ww","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/2gw8c5ww","pdf_url":"https://escholarship.org/content/qt2gw8c5ww/qt2gw8c5ww.pdf?t=qmk65x","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt67t684cz","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/67t684cz","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:qt67t684cz","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/67t684cz","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.; & Spohn, M.A.(2005). A Solution For the Location Problem in Arbitrary Computer Networks Using Generic Dominating Sets. Proceedings ACM SAC 2005. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/67t684cz","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt2gw8c5ww","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/2gw8c5ww","pdf_url":"https://escholarship.org/content/qt2gw8c5ww/qt2gw8c5ww.pdf?t=qmk65x","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2127015767.pdf","grobid_xml":"https://content.openalex.org/works/W2127015767.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1527658630","https://openalex.org/W2011662871","https://openalex.org/W2021129984","https://openalex.org/W2023454821","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W6629413194","https://openalex.org/W6631531770"],"related_works":["https://openalex.org/W2963404550","https://openalex.org/W2794522194","https://openalex.org/W2984335350","https://openalex.org/W1123717642","https://openalex.org/W1602303252","https://openalex.org/W4366983102","https://openalex.org/W3199698117","https://openalex.org/W938667614","https://openalex.org/W2012003157","https://openalex.org/W2007607373"],"abstract_inverted_index":{"Many":[0],"problems":[1,7],"exist":[2],"related":[3],"to":[4,14,19,67,84,169,215],"the":[5,23,26,37,52,59,63,95,170,184,194,212,216],"location":[6,32],"of":[8,35,41,49,75,79,89,154,172],"resources":[9],"in":[10,51,62,99,121,132,146,159],"a":[11,42,47,77,100,135,162,206],"computer":[12],"network":[13,53,64,208],"accommodate":[15],"client":[16],"demands":[17],"subject":[18],"constraints":[20],"imposed":[21,93],"on":[22,94,192,198],"clients":[24],"and":[25,112],"servers.":[27],"For":[28],"example,":[29],"one":[30,70,157],"classical":[31],"problem":[33,74,171,196,218],"consists":[34],"computing":[36,173],"dominating":[38,55,71,96],"sets":[39],"(DS)":[40],"network.":[43],"A":[44,87],"DS":[45,78,174],"is":[46,82],"set":[48,97],"nodes":[50,61],"(called":[54],"nodes)":[56],"such":[57],"that":[58,118,143],"remaining":[60],"are":[65,179,227],"adjacent":[66],"at":[68,128,155],"least":[69,129,156],"node.":[72],"The":[73],"finding":[76],"minimum":[80],"cardinality":[81],"known":[83],"be":[85,92,125,150],"NP-complete.":[86],"variety":[88],"conditions":[90,178],"may":[91],"D":[98,124,133,149,160],"graph":[101],"G":[102],"=":[103],"(V,":[104],"E).":[105],"Among":[106],"them,":[107],"we":[108],"have":[109],"multiple":[110],"domination":[111,116,141],"distance":[113,152],"domination.":[114],"Multiple":[115],"requires":[117,142],"each":[119,144],"vertex":[120,145,158],"V":[122,147],"---":[123,148],"dominated":[126],"by":[127],"k":[130],"vertices":[131],"for":[134,161,219],"fixed":[136,163],"positive":[137,164],"integer":[138,165],"k.":[139],"Distance":[140],"within":[151],"r":[153],"r.":[166],"We":[167,210],"refer":[168],"when":[175],"these":[176],"two":[177],"taken":[180],"into":[181],"account":[182],"as":[183],"Generic":[185],"Dominating":[186],"Sets":[187],"(GDS)":[188],"problem.":[189],"Prior":[190],"work":[191],"solving":[193],"GDS":[195,217],"focuses":[197],"interval":[199],"graphs":[200],"(IG),":[201],"which":[202],"can":[203],"represent":[204],"only":[205],"few":[207],"topologies.":[209],"present":[211],"first":[213],"solutions":[214],"arbitrary":[220],"graphs.":[221],"Simulation":[222],"results":[223],"regarding":[224],"several":[225],"configurations":[226],"presented.":[228]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}