{"id":"https://openalex.org/W2757966824","doi":"https://doi.org/10.1137/15m1054328","title":"Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs","display_name":"Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2757966824","doi":"https://doi.org/10.1137/15m1054328","mag":"2757966824"},"language":"en","primary_location":{"id":"doi:10.1137/15m1054328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1054328","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5062492513","display_name":"Bugra Caskurlu","orcid":"https://orcid.org/0000-0002-4647-205X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bugra Caskurlu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054627025","display_name":"Vahan Mkrtchyan","orcid":"https://orcid.org/0000-0002-2136-7835"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vahan Mkrtchyan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006200442","display_name":"Ojas Parekh","orcid":"https://orcid.org/0000-0003-2689-9264"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ojas Parekh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Subramani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3926,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.90195772,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"3","first_page":"2172","last_page":"2184"},"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.9994999766349792,"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.9994999766349792,"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.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.9293026924133301},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.9055913686752319},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7437236905097961},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.715084433555603},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5921673774719238},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5536434054374695},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5265729427337646},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5199476480484009},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4654095470905304},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4516727328300476},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.44840291142463684},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.43586987257003784},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.423453152179718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2835455536842346},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2506709098815918},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.13094103336334229}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9293026924133301},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9055913686752319},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7437236905097961},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.715084433555603},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5921673774719238},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5536434054374695},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5265729427337646},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5199476480484009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4654095470905304},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4516727328300476},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.44840291142463684},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.43586987257003784},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.423453152179718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2835455536842346},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2506709098815918},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.13094103336334229},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1054328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1054328","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3322938945","display_name":null,"funder_award_id":"FA9550-12-1-0199","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G3374713094","display_name":null,"funder_award_id":"CCF-0827397","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4264883105","display_name":null,"funder_award_id":"CNS-0849735","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G860555387","display_name":null,"funder_award_id":"CCF-1305054","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1566660502","https://openalex.org/W2015706819","https://openalex.org/W2025760771","https://openalex.org/W2030970869","https://openalex.org/W2038225707","https://openalex.org/W2040480264","https://openalex.org/W2049200290","https://openalex.org/W2070814595","https://openalex.org/W2073689249","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W2175530190","https://openalex.org/W2178856181"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W2359923140","https://openalex.org/W1848055413","https://openalex.org/W9203110","https://openalex.org/W2963603765","https://openalex.org/W4225751077","https://openalex.org/W2037935057","https://openalex.org/W2901933148"],"abstract_inverted_index":{"In":[0,79],"this":[1,80,140],"paper,":[2,81],"we":[3,82,119],"study":[4],"two":[5],"closely":[6,103],"related":[7,104],"problems":[8,26],"on":[9,59,72,94,112],"bipartite":[10,60,73,95,113],"graphs,":[11],"viz.,":[12],"the":[13,19,50,63,67,85,102,116,130,134,150],"partial":[14,68,86],"vertex":[15,51,69,87],"cover":[16,52,70,88],"problem":[17,53,71,89,108,141],"and":[18,42,128,142],"budgeted":[20,105],"maximum":[21,106],"coverage":[22,107],"problem.":[23,152],"Both":[24],"these":[25],"arise":[27],"in":[28,56],"a":[29,145],"number":[30],"of":[31,66,133],"different":[32],"application":[33],"domains,":[34],"including,":[35],"but":[36],"not":[37],"limited":[38],"to,":[39],"computer":[40],"security":[41],"transportation":[43],"logistics.":[44],"It":[45],"is":[46,54,90,109],"well":[47],"known":[48],"that":[49,84,101],"solvable":[55],"polynomial":[57],"time":[58],"graphs.":[61,96,114],"However,":[62],"computational":[64],"complexity":[65],"graphs":[74],"was":[75],"open,":[76],"thus":[77],"far.":[78],"establish":[83],"\\bf":[91,110],"NP-hard,":[92],"even":[93],"Our":[97,124],"result":[98],"also":[99],"establishes":[100],"NP-hard":[111],"For":[115],"latter":[117],"problem,":[118],"present":[120],"an":[121],"$\\frac{8}{9}$-approximation":[122],"algorithm.":[123],"approximation":[125],"guarantee":[126],"matches":[127],"resolves":[129],"integrality":[131],"gap":[132],"natural":[135],"linear":[136],"programming":[137],"relaxation":[138],"for":[139,149],"improves":[143],"upon":[144],"recent":[146],"$\\frac{4}{5}$-approximation":[147],"algorithm":[148],"same":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}