{"id":"https://openalex.org/W2964191496","doi":"https://doi.org/10.1051/ro/2017085","title":"Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio\u00a00.7","display_name":"Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio\u00a00.7","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2964191496","doi":"https://doi.org/10.1051/ro/2017085","mag":"2964191496"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2017085","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2017085","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1502.07930","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]},{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["Universit\u00e9 Paris-Dauphine, PSL* Research University, CNRS UMR 7243, LAMSADE, 75016 Paris, France","LAMSADE - Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision (Place de Lattre de Tassigny 75775 PARIS CEDEX 16 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Dauphine, PSL* Research University, CNRS UMR 7243, LAMSADE, 75016 Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE - Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision (Place de Lattre de Tassigny 75775 PARIS CEDEX 16 - France)","institution_ids":["https://openalex.org/I4210137929"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111473903"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I4210137929","https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":0.2125,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60609177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"52","issue":"1","first_page":"305","last_page":"314"},"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.9995999932289124,"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.9995999932289124,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8586359620094299},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8342136144638062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7931656837463379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.599511444568634},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5840860605239868},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5682822465896606},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4987821578979492},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.456453800201416},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4447927474975586},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4432796239852905},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41210588812828064},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40966930985450745},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2166297733783722},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21112871170043945}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8586359620094299},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8342136144638062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7931656837463379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.599511444568634},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5840860605239868},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5682822465896606},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4987821578979492},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.456453800201416},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4447927474975586},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4432796239852905},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41210588812828064},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40966930985450745},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2166297733783722},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21112871170043945},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2017085","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2017085","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1502.07930","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1502.07930","pdf_url":"https://arxiv.org/pdf/1502.07930","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1502.07930","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1502.07930","pdf_url":"https://arxiv.org/pdf/1502.07930","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"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":8,"referenced_works":["https://openalex.org/W9203110","https://openalex.org/W1512148653","https://openalex.org/W1973315504","https://openalex.org/W1974757757","https://openalex.org/W2049200290","https://openalex.org/W2080169294","https://openalex.org/W2172162445","https://openalex.org/W3161056635"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W2383239740","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":{"We":[0],"propose":[1],"and":[2],"analyze":[3],"a":[4],"simple":[5],"purely":[6],"combinatorial":[7,23],"algorithm":[8,24],"for":[9,29],"max":[10],"k":[11],"-vertex":[12],"cover":[13],"in":[14],"bipartite":[15],"graphs,":[16],"achieving":[17],"approximation":[18],"ratio":[19,39],"0.7.":[20],"The":[21],"only":[22],"currently":[25],"known":[26],"until":[27],"now":[28],"this":[30],"problem":[31],"is":[32],"the":[33],"natural":[34],"greedy":[35],"algorithm,":[36],"that":[37],"achieves":[38],"(":[40],"e":[41,44],"\u2212":[42],"1)/":[43],"=":[45],"0.632.":[46]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2019-07-30T00:00:00"}