{"id":"https://openalex.org/W2148494283","doi":"https://doi.org/10.1007/11604686_31","title":"Approximation Algorithms for Unit Disk Graphs","display_name":"Approximation Algorithms for Unit Disk Graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2148494283","doi":"https://doi.org/10.1007/11604686_31","mag":"2148494283"},"language":"en","primary_location":{"id":"doi:10.1007/11604686_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_31","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/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Erik Jan van Leeuwen","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041371022"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.5732,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.93736952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9965999722480774,"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/T11106","display_name":"Data Management and Algorithms","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8435037136077881},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6964930295944214},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6645348072052002},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.6389514207839966},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.604607105255127},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5815820693969727},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5677847266197205},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5407033562660217},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5296000838279724},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5119282007217407},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5084472894668579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47107425332069397},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4511158764362335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4107052683830261},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40294790267944336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.401468962430954},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39540430903434753},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3150980472564697},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2773313522338867},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.07543468475341797}],"concepts":[{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.8435037136077881},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6964930295944214},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6645348072052002},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.6389514207839966},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.604607105255127},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5815820693969727},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5677847266197205},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5407033562660217},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5296000838279724},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5119282007217407},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5084472894668579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47107425332069397},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4511158764362335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4107052683830261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40294790267944336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.401468962430954},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39540430903434753},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3150980472564697},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2773313522338867},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.07543468475341797},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11604686_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_31","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:pure.tue.nl:publications/d8cc217a-b5cc-40a0-b44c-6079e7b7624e","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/d8cc217a-b5cc-40a0-b44c-6079e7b7624e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Leeuwen, van, E J 2005, Approximation algorithms for unit disk graphs. in D Kratsch (ed.), Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers. Lecture Notes in Computer Science (LNCS), vol. 3787, Springer, Berlin, pp. 351-361. https://doi.org/10.1007/11604686_31","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.77.3823","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.3823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-066.pdf","raw_type":"text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/d8cc217a-b5cc-40a0-b44c-6079e7b7624e","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/d8cc217a-b5cc-40a0-b44c-6079e7b7624e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, 351 - 361","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1497640858","https://openalex.org/W1499595654","https://openalex.org/W1509326639","https://openalex.org/W1533937654","https://openalex.org/W1598306056","https://openalex.org/W1804016314","https://openalex.org/W1970118687","https://openalex.org/W1985758609","https://openalex.org/W1987776185","https://openalex.org/W2009702759","https://openalex.org/W2011039300","https://openalex.org/W2022082910","https://openalex.org/W2028738060","https://openalex.org/W2031149390","https://openalex.org/W2033405938","https://openalex.org/W2037456313","https://openalex.org/W2042509875","https://openalex.org/W2042626642","https://openalex.org/W2063572899","https://openalex.org/W2066577300","https://openalex.org/W2067264828","https://openalex.org/W2095981867","https://openalex.org/W2100961486","https://openalex.org/W2104936608","https://openalex.org/W2110282707","https://openalex.org/W2137560895","https://openalex.org/W2138117909","https://openalex.org/W2139349113","https://openalex.org/W2145797586","https://openalex.org/W2154745646","https://openalex.org/W2156760067","https://openalex.org/W2165142526","https://openalex.org/W2320614912","https://openalex.org/W2333210517","https://openalex.org/W2500252975","https://openalex.org/W2739148461","https://openalex.org/W2913109207","https://openalex.org/W2913688336","https://openalex.org/W2986773320","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2388345276","https://openalex.org/W2584896874","https://openalex.org/W2118466295","https://openalex.org/W1530712874","https://openalex.org/W1483891445","https://openalex.org/W3037291746","https://openalex.org/W2093381928","https://openalex.org/W2148494283","https://openalex.org/W3047117384","https://openalex.org/W2789268215"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-19T08:26:33.389920","created_date":"2025-10-10T00:00:00"}