{"id":"https://openalex.org/W2022712087","doi":"https://doi.org/10.1016/s0304-3975(97)00226-0","title":"Improved non-approximability results for minimum vertex cover with density constraints","display_name":"Improved non-approximability results for minimum vertex cover with density constraints","publication_year":1999,"publication_date":"1999-08-01","ids":{"openalex":"https://openalex.org/W2022712087","doi":"https://doi.org/10.1016/s0304-3975(97)00226-0","mag":"2022712087"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(97)00226-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00226-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5001082357","display_name":"Andrea Clementi","orcid":"https://orcid.org/0000-0002-9521-2457"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea E.F. Clementi","raw_affiliation_strings":["Dipartmento di Scienze dell'Informazione, Universit\u00e1 \u201cLa Sapienza\u201d, Via Salaria 113, I-00198, di Roma, Italy","Dipartmento di Scienze dell'Informazione, Universit\u00e1 \"La Sapienza\", Via Salaria 113, I-00198, di Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartmento di Scienze dell'Informazione, Universit\u00e1 \u201cLa Sapienza\u201d, Via Salaria 113, I-00198, di Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartmento di Scienze dell'Informazione, Universit\u00e1 \"La Sapienza\", Via Salaria 113, I-00198, di Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057752375","display_name":"Luca Trevisan","orcid":"https://orcid.org/0000-0002-6982-8530"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Luca Trevisan","raw_affiliation_strings":["Centre Universitaire d'Informatique, Universit\u00e9 de Gen\u00e8ve, Switzerland"],"affiliations":[{"raw_affiliation_string":"Centre Universitaire d'Informatique, Universit\u00e9 de Gen\u00e8ve, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001082357"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.9223,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.9053927,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"225","issue":"1-2","first_page":"113","last_page":"128"},"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.9998000264167786,"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.9998000264167786,"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.9901999831199646,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9761000275611877,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8424844741821289},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7525047063827515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6773485541343689},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6749271154403687},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5343049764633179},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5030218958854675},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4732701778411865},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4717850387096405},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4628670811653137},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43818971514701843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4345252513885498},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42989349365234375},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.35941028594970703},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.22852754592895508}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8424844741821289},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7525047063827515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6773485541343689},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6749271154403687},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5343049764633179},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5030218958854675},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4732701778411865},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4717850387096405},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4628670811653137},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43818971514701843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4345252513885498},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42989349365234375},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.35941028594970703},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.22852754592895508},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(97)00226-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00226-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W118210480","https://openalex.org/W1564025554","https://openalex.org/W1653108064","https://openalex.org/W1818184450","https://openalex.org/W1903636486","https://openalex.org/W1970089350","https://openalex.org/W1972345639","https://openalex.org/W1983593474","https://openalex.org/W1991006936","https://openalex.org/W1992720234","https://openalex.org/W2000869424","https://openalex.org/W2007997869","https://openalex.org/W2011039300","https://openalex.org/W2019578639","https://openalex.org/W2027048490","https://openalex.org/W2030087828","https://openalex.org/W2038225707","https://openalex.org/W2048958388","https://openalex.org/W2055656009","https://openalex.org/W2059453880","https://openalex.org/W2066356146","https://openalex.org/W2070664846","https://openalex.org/W2081254453","https://openalex.org/W2087226760","https://openalex.org/W2090863037","https://openalex.org/W2094882771","https://openalex.org/W2100308637","https://openalex.org/W2105195422","https://openalex.org/W2125347105","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2143996311","https://openalex.org/W2152221184","https://openalex.org/W2295428206","https://openalex.org/W2337943869","https://openalex.org/W2401610261","https://openalex.org/W3166880264","https://openalex.org/W4235946010","https://openalex.org/W6604879565","https://openalex.org/W6637099945","https://openalex.org/W6639840959","https://openalex.org/W6642638403","https://openalex.org/W6644040475","https://openalex.org/W6648048595","https://openalex.org/W6653726825","https://openalex.org/W6663356168","https://openalex.org/W6667076820","https://openalex.org/W6674843440","https://openalex.org/W6678588127","https://openalex.org/W6679361736","https://openalex.org/W6680972544","https://openalex.org/W6681300758"],"related_works":["https://openalex.org/W4221147992","https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W159504299","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W3102280101"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}