{"id":"https://openalex.org/W92683540","doi":null,"title":"Approximation algorithms for the L -distance vertex cover problem","display_name":"Approximation algorithms for the L -distance vertex cover problem","publication_year":2012,"publication_date":"2012-09-27","ids":{"openalex":"https://openalex.org/W92683540","mag":"92683540"},"language":"zh","primary_location":{"id":"mag:92683540","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110009455733","pdf_url":null,"source":{"id":"https://openalex.org/S4306555758","display_name":"\u7814\u7a76\u5831\u544a\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\uff08AL\uff09","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u7814\u7a76\u5831\u544a\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\uff08AL\uff09","raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5101413049","display_name":"Qiaoyun Chen","orcid":"https://orcid.org/0000-0001-6400-8640","observed_orcids":["https://orcid.org/0000-0001-6400-8640"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiaoyun Chen","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6400-8640","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075053640","display_name":"Liang Zhao","orcid":"https://orcid.org/0000-0003-0869-7896","observed_orcids":["https://orcid.org/0000-0003-0869-7896"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang Zhao","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0869-7896","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6752,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68646372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2012","issue":"5","first_page":"1","last_page":"3"},"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.9639000296592712,"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.9639000296592712,"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.03319999948143959,"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.0007999999797903001,"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/approximation-algorithms","display_name":"approximation algorithms","score":0.843999981880188},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.8080000281333923},{"id":"https://openalex.org/keywords/distance-constraints","display_name":"distance constraints","score":0.43299999833106995},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.4269999861717224}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.551175057888031},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4589465856552124},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4510214030742645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44455158710479736},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4377601146697998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.400264173746109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38725733757019043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2648128271102905}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:92683540","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110009455733","pdf_url":null,"source":{"id":"https://openalex.org/S4306555758","display_name":"\u7814\u7a76\u5831\u544a\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\uff08AL\uff09","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"\u7814\u7a76\u5831\u544a\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\uff08AL\uff09","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2015706819","https://openalex.org/W1797266394","https://openalex.org/W2081502538","https://openalex.org/W1996192003","https://openalex.org/W2108099275","https://openalex.org/W3046662382","https://openalex.org/W1969844791","https://openalex.org/W3116690795","https://openalex.org/W2030755759","https://openalex.org/W3043354996","https://openalex.org/W2949632834","https://openalex.org/W2993003528","https://openalex.org/W2109163646","https://openalex.org/W2964379911","https://openalex.org/W1972906866","https://openalex.org/W3136945252","https://openalex.org/W2170103551","https://openalex.org/W2181992650","https://openalex.org/W267188008","https://openalex.org/W1979511537"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2025-10-10T00:00:00"}