{"id":"https://openalex.org/W4323656853","doi":"https://doi.org/10.1137/21m1434052","title":"On Min Sum Vertex Cover and Generalized Min Sum Set Cover","display_name":"On Min Sum Vertex Cover and Generalized Min Sum Set Cover","publication_year":2023,"publication_date":"2023-03-09","ids":{"openalex":"https://openalex.org/W4323656853","doi":"https://doi.org/10.1137/21m1434052"},"language":"en","primary_location":{"id":"doi:10.1137/21m1434052","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1434052","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Michigan, Ann Arbor, MI 48109 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Michigan, Ann Arbor, MI 48109 USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059145110","display_name":"Jatin Batra","orcid":"https://orcid.org/0000-0002-7174-9778"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jatin Batra","raw_affiliation_strings":["School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400005 India"],"raw_orcid":"https://orcid.org/0000-0002-7174-9778","affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400005 India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101718852","display_name":"Majid Farhadi","orcid":"https://orcid.org/0000-0003-4397-8220"},"institutions":[{"id":"https://openalex.org/I4210146300","display_name":"Trading Technologies (United States)","ror":"https://ror.org/051gpmw62","country_code":"US","type":"company","lineage":["https://openalex.org/I4210146300"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Majid Farhadi","raw_affiliation_strings":["Jump Trading LLC, Chicago, IL 60654 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jump Trading LLC, Chicago, IL 60654 USA","institution_ids":["https://openalex.org/I4210146300"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047220138","display_name":"Prasad Tetali","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Tetali","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213 USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61736591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"52","issue":"2","first_page":"327","last_page":"357"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962000250816345,"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/vertex-cover","display_name":"Vertex cover","score":0.8012880682945251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.767414927482605},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6880906820297241},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6173887252807617},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6106788516044617},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6010560393333435},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6006548404693604},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.546351969242096},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5308272242546082},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5062002539634705},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.49755218625068665},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.47261595726013184},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.4582570791244507},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44915878772735596},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4472714364528656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3253939151763916},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.311352014541626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11055129766464233}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8012880682945251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.767414927482605},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6880906820297241},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6173887252807617},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6106788516044617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6010560393333435},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6006548404693604},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.546351969242096},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5308272242546082},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5062002539634705},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.49755218625068665},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.47261595726013184},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.4582570791244507},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44915878772735596},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4472714364528656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3253939151763916},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.311352014541626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11055129766464233},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1434052","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1434052","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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":16,"referenced_works":["https://openalex.org/W1527357347","https://openalex.org/W1978007997","https://openalex.org/W2000602248","https://openalex.org/W2004759812","https://openalex.org/W2059245204","https://openalex.org/W2127277545","https://openalex.org/W2130418601","https://openalex.org/W2134331592","https://openalex.org/W2143996311","https://openalex.org/W2148204686","https://openalex.org/W2163760871","https://openalex.org/W2165799042","https://openalex.org/W2175796269","https://openalex.org/W2489231761","https://openalex.org/W2963659614","https://openalex.org/W2965775701"],"related_works":["https://openalex.org/W2044818254","https://openalex.org/W1655051759","https://openalex.org/W1840962598","https://openalex.org/W1558145674","https://openalex.org/W2100782222","https://openalex.org/W2579422054","https://openalex.org/W3043721617","https://openalex.org/W4287714172","https://openalex.org/W4323656853","https://openalex.org/W3114773064"],"abstract_inverted_index":{"We":[0,59,191],"study":[1],"the":[2,21,29,33,38,46,57,69,77,99,119,133,144,178,204,211,226,231,241,260,283],"Generalized":[3],"Min":[4,85,164],"Sum":[5,86,165],"Set":[6,87],"Cover":[7,88,167],"(GMSSC)":[8],"problem,":[9],"wherein":[10],"given":[11],"a":[12,40,61,123,148,170,182,193,199,234],"collection":[13],"of":[14,28,37,52,73,84,104,132,135,147,150,158,174,215,228,230,252,259,262,282],"hyperedges":[15],"with":[16],"arbitrary":[17],"covering":[18],"requirements":[19],",":[20,255,276],"goal":[22],"is":[23,42,115,169,181],"to":[24,31,68,106,248,273],"find":[25],"an":[26,141],"ordering":[27],"vertices":[30,54],"minimize":[32],"total":[34],"cover":[35],"time":[36,48],"hyperedges;":[39],"hyperedge":[41],"considered":[43],"covered":[44],"by":[45,91,122],"first":[47],"when":[49],"and":[50,94,96,109,126,161,186,197,218,224,266,268],"many":[51],"its":[53,270],"appear":[55],"in":[56,176],"ordering.":[58],"give":[60,192],"approximation":[62,194,214,250,285],"algorithm":[63,114,244],"for":[64,76,187,195,203,253,286],"GMSSC,":[65],"coming":[66],"close":[67],"best":[70,101,213],"possible":[71],"bound":[72,103],"4,":[74],"already":[75],"classical":[78],"special":[79,172],"case":[80,173],"(with":[81],"all":[82,254],")":[83,185],"(MSSC)":[89],"studied":[90],"Feige,":[92,217],"Lov\u00e1sz,":[93],"Tetali,":[95],"improving":[97],"upon":[98,210],"previous":[100,212],"known":[102],"due":[105],"Im,":[107],"Sviridenko,":[108],"van":[110],"der":[111],"Zwaan.":[112],"Our":[113],"based":[116],"on":[117,143],"transforming":[118],"LP":[120,206],"solution":[121],"suitable":[124],"kernel":[125],"applying":[127],"randomized":[128],"rounding.":[129],"As":[130],"part":[131],"analysis":[134],"our":[136],"algorithm,":[137],"we":[138,221,238],"also":[139],"derive":[140],"inequality":[142],"lower":[145],"tail":[146],"sum":[149],"independent":[151,159],"Bernoulli":[152],"random":[153],"variables,":[154],"which":[155,177],"might":[156],"be":[157],"interest":[160],"broader":[162],"utility.":[163],"Vertex":[166],"(MSVC)":[168],"well-known":[171],"MSSC":[175,223],"input":[179],"hypergraph":[180],"graph":[183],"(i.e.,":[184],"every":[188],"edge":[189],".":[190],"MSVC":[196],"show":[198,239],"matching":[200],"integrality":[201],"gap":[202],"natural":[205,242],"relaxation.":[207],"This":[208],"improves":[209],"Barenholz,":[216],"Peleg.":[219],"Finally,":[220],"revisit":[222],"consider":[225],"norm":[227],"cover-time":[229],"hyperedges.":[232],"Using":[233],"dual":[235],"fitting":[236],"argument,":[237],"that":[240],"greedy":[243],"achieves":[245],"tight,":[246],"up":[247,272],"NP-hardness,":[249],"guarantees":[251],"giving":[256],"another":[257,280],"proof":[258,281],"result":[261],"Golovin,":[263],"Gupta,":[264],"Kumar,":[265],"Tangwongsan,":[267],"showing":[269],"tightness":[271],"NP-hardness.":[274],"For":[275],"this":[277],"gives":[278],"yet":[279],"4":[284],"MSSC.":[287]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}