{"id":"https://openalex.org/W2048390544","doi":"https://doi.org/10.1007/978-3-540-30140-0_19","title":"Approximation Hardness of Dominating Set Problems","display_name":"Approximation Hardness of Dominating Set Problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2048390544","doi":"https://doi.org/10.1007/978-3-540-30140-0_19","mag":"2048390544"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30140-0_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30140-0_19","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":true,"oa_status":"green","oa_url":"https://figshare.com/articles/presentation/Approximation_hardness_of_dominating_set_problems/23357717","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022095494","display_name":"Miroslav Chleb\u00edk","orcid":"https://orcid.org/0000-0001-8137-479X"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210091327","display_name":"Max Planck Institute for Mathematics in the Sciences","ror":"https://ror.org/00ez2he07","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210091327"]},{"id":"https://openalex.org/I4210119712","display_name":"Max Planck Institute for Mathematics","ror":"https://ror.org/02dh8ja68","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210119712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Miroslav Chleb\u00edk","raw_affiliation_strings":["Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany","Max Planck Institute for Mathematics in the Sciences#TAB#"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany","institution_ids":["https://openalex.org/I4210119712","https://openalex.org/I4210091327"]},{"raw_affiliation_string":"Max Planck Institute for Mathematics in the Sciences#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061610147","display_name":"Janka Chleb\u0131\u0301kov\u00e1","orcid":"https://orcid.org/0000-0002-9493-2049"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Janka Chleb\u00edkov\u00e1","raw_affiliation_strings":["Faculty of Mathematics, Physics and Informatics, Mlynsk\u00e1 dolina, Bratislava, Slovakia","Faculty of Mathematics, Physics and Informatics, Mlynsk\u00e1 dolina"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Physics and Informatics, Mlynsk\u00e1 dolina, Bratislava, Slovakia","institution_ids":[]},{"raw_affiliation_string":"Faculty of Mathematics, Physics and Informatics, Mlynsk\u00e1 dolina","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022095494"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210091327","https://openalex.org/I4210119712"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1001,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.79334501,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"203"},"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.9994999766349792,"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.9994999766349792,"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.9980000257492065,"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.9945999979972839,"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/connected-dominating-set","display_name":"Connected dominating set","score":0.8400875329971313},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7561012506484985},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6951355934143066},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6171440482139587},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5576632022857666},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5429409146308899},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5185676217079163},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49259668588638306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47498956322669983},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4684106707572937},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4465585947036743},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4135969579219818},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.401478111743927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3649775981903076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18517109751701355}],"concepts":[{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.8400875329971313},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7561012506484985},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6951355934143066},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6171440482139587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5576632022857666},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5429409146308899},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5185676217079163},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49259668588638306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47498956322669983},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4684106707572937},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4465585947036743},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4135969579219818},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.401478111743927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3649775981903076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18517109751701355},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-30140-0_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30140-0_19","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:figshare.com:article/23357717","is_oa":true,"landing_page_url":"https://figshare.com/articles/presentation/Approximation_hardness_of_dominating_set_problems/23357717","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/23357717","is_oa":true,"landing_page_url":"https://figshare.com/articles/presentation/Approximation_hardness_of_dominating_set_problems/23357717","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W282776240","https://openalex.org/W1497149493","https://openalex.org/W1501362196","https://openalex.org/W1518985150","https://openalex.org/W1578099820","https://openalex.org/W1590025341","https://openalex.org/W1886615367","https://openalex.org/W1916472382","https://openalex.org/W1959324184","https://openalex.org/W1976422444","https://openalex.org/W1980328919","https://openalex.org/W1988133548","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2004012902","https://openalex.org/W2015698277","https://openalex.org/W2021818872","https://openalex.org/W2022712087","https://openalex.org/W2028146521","https://openalex.org/W2035040468","https://openalex.org/W2038610166","https://openalex.org/W2047424666","https://openalex.org/W2082868046","https://openalex.org/W2083165612","https://openalex.org/W2090487839","https://openalex.org/W2122858887","https://openalex.org/W2128024934","https://openalex.org/W2134003300","https://openalex.org/W2141815340","https://openalex.org/W2143996311","https://openalex.org/W2156760067","https://openalex.org/W2504529850","https://openalex.org/W2572321817","https://openalex.org/W3043081082"],"related_works":["https://openalex.org/W122526503","https://openalex.org/W2388345276","https://openalex.org/W2219026216","https://openalex.org/W2134003300","https://openalex.org/W2048390544","https://openalex.org/W2105432809","https://openalex.org/W2155177580","https://openalex.org/W2133372967","https://openalex.org/W2094067618","https://openalex.org/W2505708418"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}