{"id":"https://openalex.org/W2007607373","doi":"https://doi.org/10.1145/1655925.1655948","title":"Approximation for minimum total dominating set","display_name":"Approximation for minimum total dominating set","publication_year":2009,"publication_date":"2009-11-24","ids":{"openalex":"https://openalex.org/W2007607373","doi":"https://doi.org/10.1145/1655925.1655948","mag":"2007607373"},"language":"en","primary_location":{"id":"doi:10.1145/1655925.1655948","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1655925.1655948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human","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/A5084366355","display_name":"Junmin Zhu","orcid":"https://orcid.org/0009-0006-5934-650X"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junmin Zhu","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China","[Shanghai Jiao Tong University, Shanghai, China]"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"[Shanghai Jiao Tong University, Shanghai, China]","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084366355"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.7099,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.70209546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"124"},"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.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/dominating-set","display_name":"Dominating set","score":0.83697909116745},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7415111660957336},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.671461284160614},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5933071374893188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5910060405731201},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5905008912086487},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5645456314086914},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5304889678955078},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5116961002349854},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45462891459465027},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45401301980018616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43851256370544434},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.24258285760879517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23435908555984497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19045859575271606},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.13712865114212036},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08945193886756897},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06545540690422058}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.83697909116745},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7415111660957336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.671461284160614},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5933071374893188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5910060405731201},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5905008912086487},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5645456314086914},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5304889678955078},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5116961002349854},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45462891459465027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45401301980018616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43851256370544434},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.24258285760879517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23435908555984497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19045859575271606},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.13712865114212036},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08945193886756897},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06545540690422058},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1655925.1655948","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1655925.1655948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4493587416","display_name":null,"funder_award_id":"60673049","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1590025341","https://openalex.org/W1968143987","https://openalex.org/W1980328919","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2004012902","https://openalex.org/W2011039300","https://openalex.org/W2028146521","https://openalex.org/W2040579873","https://openalex.org/W2048390544","https://openalex.org/W2090487839","https://openalex.org/W2100308637","https://openalex.org/W2134003300","https://openalex.org/W2143996311","https://openalex.org/W2798566347","https://openalex.org/W6724904386"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W3037291746","https://openalex.org/W2155984879","https://openalex.org/W2388345276","https://openalex.org/W3164644441","https://openalex.org/W1483891445","https://openalex.org/W3047117384","https://openalex.org/W2007607373"],"abstract_inverted_index":{"A":[0],"total":[1,24],"dominating":[2,6,25],"set":[3,7,26],"is":[4,44],"a":[5,10,31],"which":[8],"induces":[9],"subgraph":[11],"without":[12],"isolated":[13],"vertices.":[14],"In":[15],"this":[16,59],"paper,":[17],"we":[18,29,53],"study":[19],"the":[20,45,49],"approximation":[21,39,56],"of":[22,48,58,64],"minimum":[23],"problem.":[27],"First,":[28],"present":[30],"new":[32],"analysis":[33],"for":[34],"one-step":[35],"greedy":[36],"algorithm":[37],"with":[38],"ratio":[40],"ln(\u03b4-0.5)+1.5,":[41],"where":[42],"\u03b4":[43],"maximum":[46],"degree":[47,70],"given":[50],"graph.":[51],"Second,":[52],"prove":[54],"some":[55],"hardness":[57],"problem":[60],"on":[61],"various":[62],"classes":[63],"graphs,":[65,68,71,73],"including":[66],"sparse":[67],"small":[69],"directed":[72],"etc.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
