{"id":"https://openalex.org/W2205962382","doi":"https://doi.org/10.1109/bigdata.2015.7364032","title":"Efficient approximation algorithms to determine minimum partial dominating sets in social networks","display_name":"Efficient approximation algorithms to determine minimum partial dominating sets in social networks","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W2205962382","doi":"https://doi.org/10.1109/bigdata.2015.7364032","mag":"2205962382"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2015.7364032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2015.7364032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Big Data (Big Data)","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/A5109458663","display_name":"Alina C\u00e2mpan","orcid":"https://orcid.org/0000-0002-9296-3036"},"institutions":[{"id":"https://openalex.org/I168416876","display_name":"Northern Kentucky University","ror":"https://ror.org/01k44g025","country_code":"US","type":"education","lineage":["https://openalex.org/I168416876"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alina Campan","raw_affiliation_strings":["Computer Science Department, Northern Kentucky University Highland Heights, KY, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Northern Kentucky University Highland Heights, KY, U.S.A","institution_ids":["https://openalex.org/I168416876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067651880","display_name":"Traian Marius Tru\u0163\u0103","orcid":"https://orcid.org/0000-0001-9447-4861"},"institutions":[{"id":"https://openalex.org/I168416876","display_name":"Northern Kentucky University","ror":"https://ror.org/01k44g025","country_code":"US","type":"education","lineage":["https://openalex.org/I168416876"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Traian Marius Truta","raw_affiliation_strings":["Computer Science Department, Northern Kentucky University Highland Heights, KY, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Northern Kentucky University Highland Heights, KY, U.S.A","institution_ids":["https://openalex.org/I168416876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038289527","display_name":"Matthew Beckerich","orcid":null},"institutions":[{"id":"https://openalex.org/I168416876","display_name":"Northern Kentucky University","ror":"https://ror.org/01k44g025","country_code":"US","type":"education","lineage":["https://openalex.org/I168416876"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Beckerich","raw_affiliation_strings":["Computer Science Department, Northern Kentucky University Highland Heights, KY, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Northern Kentucky University Highland Heights, KY, U.S.A","institution_ids":["https://openalex.org/I168416876"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109458663"],"corresponding_institution_ids":["https://openalex.org/I168416876"],"apc_list":null,"apc_paid":null,"fwci":0.2386,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58332936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2390","last_page":"2397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9976999759674072,"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.9958000183105469,"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.715495228767395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6241055727005005},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5627606511116028},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5575717091560364},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5036999583244324},{"id":"https://openalex.org/keywords/social-network-analysis","display_name":"Social network analysis","score":0.4679469168186188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.326588898897171},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3246384263038635},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26141268014907837}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.715495228767395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6241055727005005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5627606511116028},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5575717091560364},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5036999583244324},{"id":"https://openalex.org/C114713312","wikidata":"https://www.wikidata.org/wiki/Q7551269","display_name":"Social network analysis","level":3,"score":0.4679469168186188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.326588898897171},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3246384263038635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26141268014907837},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C518677369","wikidata":"https://www.wikidata.org/wiki/Q202833","display_name":"Social media","level":2,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2015.7364032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2015.7364032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1567678169","https://openalex.org/W1980243423","https://openalex.org/W1999667176","https://openalex.org/W2011039300","https://openalex.org/W2038550366","https://openalex.org/W2044881936","https://openalex.org/W2045349136","https://openalex.org/W2058508948","https://openalex.org/W2066561381","https://openalex.org/W2083750870","https://openalex.org/W2091946919","https://openalex.org/W2095334215","https://openalex.org/W2111769183","https://openalex.org/W2163322487","https://openalex.org/W2257961952","https://openalex.org/W2322463788","https://openalex.org/W2469279958","https://openalex.org/W2755088640","https://openalex.org/W2890698010","https://openalex.org/W3101995668","https://openalex.org/W6610072603","https://openalex.org/W6659791984","https://openalex.org/W6692218029","https://openalex.org/W6754120469","https://openalex.org/W7062128137"],"related_works":["https://openalex.org/W3184131894","https://openalex.org/W2513388465","https://openalex.org/W1490764355","https://openalex.org/W2329407138","https://openalex.org/W885288402","https://openalex.org/W4221065207","https://openalex.org/W3183249681","https://openalex.org/W1494193122","https://openalex.org/W4361282174","https://openalex.org/W2007607373"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,62],"report":[4],"on":[5,28,42,59,104],"extensive":[6],"experiments":[7,26,77],"for":[8,16,72,91],"determining":[9],"partial":[10,56,73,94],"dominating":[11,57,74,95],"sets":[12,58],"of":[13,19,111],"small":[14],"size":[15],"various":[17],"types":[18],"real":[20,30],"and":[21,41,46,108],"synthetic":[22,44],"social":[23,51],"networks.":[24],"Our":[25,76],"ran":[27],"several":[29,82],"network":[31,52,106],"datasets":[32],"made":[33],"available":[34],"by":[35],"the":[36,92,105,109,112],"Stanford":[37],"Network":[38],"Analysis":[39],"Project":[40],"some":[43],"power-law":[45],"random":[47],"networks":[48,61],"created":[49],"with":[50],"generators.":[53],"To":[54],"compute":[55],"these":[60],"used":[63],"five":[64],"algorithms":[65,84],"compared":[66],"in":[67],"[4],":[68],"which":[69],"were":[70],"adapted":[71],"sets.":[75],"showed":[78],"that":[79,85],"there":[80],"are":[81],"good":[83],"can":[86],"efficiently":[87],"find":[88],"quality":[89],"approximations":[90],"minimum-size":[93],"set":[96],"problem.":[97],"The":[98],"best":[99],"algorithm":[100],"choice":[101],"is":[102],"dependent":[103],"characteristics":[107],"value":[110],"coverage":[113],"parameter.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}