{"id":"https://openalex.org/W3112765143","doi":"https://doi.org/10.3390/a13120339","title":"A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph","display_name":"A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3112765143","doi":"https://doi.org/10.3390/a13120339","mag":"3112765143"},"language":"en","primary_location":{"id":"doi:10.3390/a13120339","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120339","pdf_url":"https://www.mdpi.com/1999-4893/13/12/339/pdf?version=1607925434","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/12/339/pdf?version=1607925434","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100613889","display_name":"Jonathan Li","orcid":"https://orcid.org/0000-0001-7899-0049"},"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":"Jonathan Li","raw_affiliation_strings":["Department of Computer Science, College of Natural Sciences, The University of Texas at Austin, Austin, TX 78712, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, College of Natural Sciences, The University of Texas at Austin, Austin, TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003972907","display_name":"Rohan Potru","orcid":"https://orcid.org/0000-0002-2067-7532"},"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":"Rohan Potru","raw_affiliation_strings":["Department of Computer Science, College of Natural Sciences, The University of Texas at Austin, Austin, TX 78712, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, College of Natural Sciences, The University of Texas at Austin, Austin, TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113484676","display_name":"Farhad Shahrokhi","orcid":null},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Farhad Shahrokhi","raw_affiliation_strings":["Department of Computer Science and Engineering, College of Engineering, University of North Texas, Denton, TX 76203, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, College of Engineering, University of North Texas, Denton, TX 76203, USA","institution_ids":["https://openalex.org/I123534392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113484676"],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.1551,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8399546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"13","issue":"12","first_page":"339","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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.9991999864578247,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9936000108718872,"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.8329012393951416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6875255107879639},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5529838800430298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.539788544178009},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.49521604180336},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4821002781391144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45332637429237366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4068748950958252},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22197741270065308}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8329012393951416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6875255107879639},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5529838800430298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.539788544178009},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.49521604180336},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4821002781391144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45332637429237366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4068748950958252},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22197741270065308},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a13120339","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120339","pdf_url":"https://www.mdpi.com/1999-4893/13/12/339/pdf?version=1607925434","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:info:ark/67531/metadc1934111","is_oa":false,"landing_page_url":"https://digital.library.unt.edu/ark:/67531/metadc1934111/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400792","display_name":"University of North Texas Digital Library (University of North Texas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123534392","host_organization_name":"University of North Texas","host_organization_lineage":["https://openalex.org/I123534392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 13(12), Multidisciplinary Digital Publishing Institute, December 14, 2020, pp. 1-20","raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:10089880110e404ca6d9b3b9ae9e5186","is_oa":true,"landing_page_url":"https://doaj.org/article/10089880110e404ca6d9b3b9ae9e5186","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 12, p 339 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/12/339/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13120339","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 13; Issue 12; Pages: 339","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13120339","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120339","pdf_url":"https://www.mdpi.com/1999-4893/13/12/339/pdf?version=1607925434","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3112765143.pdf","grobid_xml":"https://content.openalex.org/works/W3112765143.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W324754135","https://openalex.org/W1963547452","https://openalex.org/W2010042187","https://openalex.org/W2022671649","https://openalex.org/W2038550366","https://openalex.org/W2044471216","https://openalex.org/W2048652909","https://openalex.org/W2063572899","https://openalex.org/W2066356146","https://openalex.org/W2079522169","https://openalex.org/W2084507343","https://openalex.org/W2106246723","https://openalex.org/W2143305437","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2401610261","https://openalex.org/W2589200750","https://openalex.org/W2611770526","https://openalex.org/W2752885492","https://openalex.org/W2890698010","https://openalex.org/W2963296241","https://openalex.org/W2963620515","https://openalex.org/W4206334169","https://openalex.org/W6661977751","https://openalex.org/W6754120469"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W2268207117","https://openalex.org/W4300488607","https://openalex.org/W2951095575","https://openalex.org/W2105543801","https://openalex.org/W1530375092","https://openalex.org/W1916943706","https://openalex.org/W2002272911","https://openalex.org/W2561769964","https://openalex.org/W2543175834"],"abstract_inverted_index":{"We":[0],"implement":[1],"and":[2,33,44,62,128,153,189,204],"test":[3,52],"the":[4,12,22,26,42,49,69,75,85,94,126,143,148,158,163],"performances":[5],"of":[6,16,51,71,114,133,162,177],"several":[7],"approximation":[8],"algorithms":[9,20,32,55,96,130],"for":[10,151,175],"computing":[11],"minimum":[13],"dominating":[14],"set":[15],"a":[17,34,102,119,197,205],"graph.":[18],"These":[19],"are":[21,173],"standard":[23],"greedy":[24,43,127,156],"algorithm,":[25],"recent":[27],"Linear":[28],"programming":[29],"(LP)":[30],"rounding":[31,46,90,108,179],"hybrid":[35,129,144,164],"algorithm":[36,91,145,165],"that":[37,172],"we":[38,194],"design":[39],"by":[40,74],"combining":[41],"LP":[45,76,89,107,178,183,190],"algorithms.":[47],"Over":[48],"range":[50],"data,":[53],"all":[54],"perform":[56],"better":[57],"than":[58,111],"anticipated":[59],"in":[60,137,187],"theory,":[61],"have":[63,82],"small":[64],"performance":[65,122,134],"ratios,":[66],"measured":[67],"as":[68,193],"size":[70],"output":[72],"divided":[73],"objective":[77],"lower":[78],"bound.":[79],"However,":[80],"each":[81],"advantages":[83],"over":[84],"others.":[86],"For":[87,140],"instance,":[88],"normally":[92,146],"outperforms":[93,147,157],"other":[95],"on":[97,196,208],"sparse":[98],"real-world":[99,198],"graphs.":[100],"On":[101],"graph":[103,199,207],"with":[104,121,200],"400,000+":[105],"vertices,":[106],"took":[109],"less":[110],"15":[112],"s":[113],"CPU":[115],"time":[116],"to":[117,167],"generate":[118],"solution":[120],"ratio":[123,135],"1.011,":[124],"while":[125],"generated":[131],"solutions":[132],"1.12":[136],"similar":[138],"time.":[139],"synthetic":[141],"graphs,":[142,155],"others,":[149],"whereas":[150],"hypercubes":[152],"k-Queens":[154],"rest.":[159],"Another":[160],"advantage":[161],"is":[166],"solve":[168],"very":[169],"large":[170],"problems":[171],"suitable":[174],"application":[176],"(sparse":[180],"graphs)":[181],"but":[182],"formulations":[184],"become":[185],"formidable":[186],"practice":[188],"solvers":[191],"crash,":[192],"observed":[195],"7.7":[201],"million+":[202],"vertices":[203],"planar":[206],"1,000,000":[209],"vertices.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2020-12-21T00:00:00"}