{"id":"https://openalex.org/W1592244227","doi":"https://doi.org/10.1007/3-540-44968-x_11","title":"Approximation Algorithms for Independent Sets in Map Graphs","display_name":"Approximation Algorithms for Independent Sets in Map Graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1592244227","doi":"https://doi.org/10.1007/3-540-44968-x_11","mag":"1592244227"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44968-x_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44968-x_11","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/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":["Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","institution_ids":["https://openalex.org/I165522056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":["https://openalex.org/I165522056"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15138662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9976999759674072,"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/vertex-cover","display_name":"Vertex cover","score":0.7543630599975586},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6310322284698486},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6010750532150269},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5174501538276672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5084596872329712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4875297248363495},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4671328365802765},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44290944933891296},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4408968389034271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43748411536216736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.413421630859375},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4127481281757355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3857775330543518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3384026885032654},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.24975183606147766},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.17209398746490479}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7543630599975586},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6310322284698486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6010750532150269},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5174501538276672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5084596872329712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4875297248363495},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4671328365802765},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44290944933891296},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4408968389034271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43748411536216736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.413421630859375},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4127481281757355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3857775330543518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3384026885032654},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.24975183606147766},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.17209398746490479},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44968-x_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44968-x_11","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1501644705","https://openalex.org/W1504740823","https://openalex.org/W1982180670","https://openalex.org/W2038643780","https://openalex.org/W2043745737","https://openalex.org/W2044384336","https://openalex.org/W2059372025","https://openalex.org/W2070734176","https://openalex.org/W2081254453","https://openalex.org/W2156760067"],"related_works":["https://openalex.org/W3003449463","https://openalex.org/W2963989216","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W2359923140","https://openalex.org/W2964258819","https://openalex.org/W2029933769","https://openalex.org/W2742166337","https://openalex.org/W2551034790","https://openalex.org/W2037935057"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}