{"id":"https://openalex.org/W1607840687","doi":"https://doi.org/10.1007/11830924_3","title":"Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs","display_name":"Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1607840687","doi":"https://doi.org/10.1007/11830924_3","mag":"1607840687"},"language":"en","primary_location":{"id":"doi:10.1007/11830924_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11830924_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5085876663","display_name":"Christoph Amb\u00fchl","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Christoph Amb\u00fchl","raw_affiliation_strings":["Department of Computer Science, University of Liverpool,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool,","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Department of Computer Science, University of Liverpool,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool,","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038083135","display_name":"Mat\u00fa\u0161 Miha\u013e\u00e1k","orcid":"https://orcid.org/0000-0002-1898-607X"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mat\u00fa\u0161 Mihal\u00e1k","raw_affiliation_strings":["Department of Computer Science, University of Liverpool,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool,","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051123931","display_name":"Marc Nunkesser","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Marc Nunkesser","raw_affiliation_strings":["Institute of Theoretical Computer Science, ETH Z\u00fcrich,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, ETH Z\u00fcrich,","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":11.6225,"has_fulltext":false,"cited_by_count":165,"citation_normalized_percentile":{"value":0.99118769,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"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.9991999864578247,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9930999875068665,"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/unit-disk-graph","display_name":"Unit disk graph","score":0.8437948226928711},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6784998178482056},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6582261323928833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6150429248809814},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.5921159982681274},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.586736798286438},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5736292004585266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4865095019340515},{"id":"https://openalex.org/keywords/unit-square","display_name":"Unit square","score":0.44822603464126587},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4409506916999817},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.42739859223365784},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.41551294922828674},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3742607831954956},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37008821964263916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3035838007926941},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.28369981050491333},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.18563932180404663},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.15055468678474426},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.08418700098991394}],"concepts":[{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.8437948226928711},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6784998178482056},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6582261323928833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6150429248809814},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.5921159982681274},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.586736798286438},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5736292004585266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4865095019340515},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.44822603464126587},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4409506916999817},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.42739859223365784},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.41551294922828674},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3742607831954956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37008821964263916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3035838007926941},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.28369981050491333},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.18563932180404663},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.15055468678474426},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.08418700098991394},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/11830924_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11830924_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/1b86d2b5-df69-4ed1-ba48-497b1d0549ce","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/1b86d2b5-df69-4ed1-ba48-497b1d0549ce","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Amb\u00fchl, C, Erlebach, T, Mihal\u00e1k, M & Nunkesser, M 2006, Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. in Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). pp. 3-14. https://doi.org/10.1007/11830924_3","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.109.7244","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.7244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.le.ac.uk/people/te17/papers/CS-06-008.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":21,"referenced_works":["https://openalex.org/W1607840687","https://openalex.org/W1970026476","https://openalex.org/W2000869424","https://openalex.org/W2011039300","https://openalex.org/W2021544892","https://openalex.org/W2022082910","https://openalex.org/W2022671649","https://openalex.org/W2028738060","https://openalex.org/W2047723482","https://openalex.org/W2063572899","https://openalex.org/W2066577300","https://openalex.org/W2100961486","https://openalex.org/W2139349113","https://openalex.org/W2143996311","https://openalex.org/W2145797586","https://openalex.org/W2148494283","https://openalex.org/W2156760067","https://openalex.org/W2611804663","https://openalex.org/W4249318479","https://openalex.org/W4285719527","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W2388345276","https://openalex.org/W2584896874","https://openalex.org/W2118466295","https://openalex.org/W4313349320","https://openalex.org/W1530712874","https://openalex.org/W2391238671","https://openalex.org/W2093381928","https://openalex.org/W2148494283","https://openalex.org/W1607840687","https://openalex.org/W2155234080"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":23}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}