{"id":"https://openalex.org/W1988837529","doi":"https://doi.org/10.1137/s0097539793260763","title":"Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs","display_name":"Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1988837529","doi":"https://doi.org/10.1137/s0097539793260763","mag":"1988837529"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793260763","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793260763","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/A5104023644","display_name":"Sridhar Rajagopalan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sridhar Rajagopalan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007368382","display_name":"Vijay V. Vazirani","orcid":"https://orcid.org/0000-0002-4106-9077"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijay V. Vazirani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0113,"has_fulltext":false,"cited_by_count":165,"citation_normalized_percentile":{"value":0.74141272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"28","issue":"2","first_page":"525","last_page":"540"},"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.9998999834060669,"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.9998999834060669,"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.9973999857902527,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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/set-cover-problem","display_name":"Set cover problem","score":0.8753623962402344},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6849799752235413},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6457613110542297},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5850231051445007},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5772435665130615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5390616655349731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49463436007499695},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47869518399238586},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4619036316871643},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.44231700897216797},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4146444499492645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35365837812423706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33019864559173584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3294563889503479}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.8753623962402344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6849799752235413},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6457613110542297},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5850231051445007},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5772435665130615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5390616655349731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49463436007499695},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47869518399238586},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4619036316871643},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.44231700897216797},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4146444499492645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35365837812423706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33019864559173584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3294563889503479},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793260763","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793260763","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":11,"referenced_works":["https://openalex.org/W2040924621","https://openalex.org/W2063241141","https://openalex.org/W2073127061","https://openalex.org/W2079473728","https://openalex.org/W2104103056","https://openalex.org/W2144970024","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2401610261","https://openalex.org/W3011766368","https://openalex.org/W4241840173"],"related_works":["https://openalex.org/W1550117727","https://openalex.org/W3095810947","https://openalex.org/W2202486749","https://openalex.org/W2325870907","https://openalex.org/W2147086810","https://openalex.org/W2163115662","https://openalex.org/W41005574","https://openalex.org/W3204684126","https://openalex.org/W1594413663","https://openalex.org/W2019216770"],"abstract_inverted_index":{"We":[0],"build":[1],"on":[2],"the":[3,11,14,24,57],"classical":[4],"greedy":[5],"sequential":[6],"set":[7,25,53],"cover":[8,26],"algorithm,":[9],"in":[10,60],"spirit":[12],"of":[13,42],"primal-dual":[15],"schema,":[16],"to":[17],"obtain":[18],"simple":[19],"parallel":[20,46],"approximation":[21,47],"algorithms":[22,32,48],"for":[23,52,56],"problem":[27],"and":[28,35],"its":[29],"generalizations.":[30],"Our":[31],"use":[33],"randomization,":[34],"our":[36],"randomized":[37],"voting":[38],"lemmas":[39],"may":[40],"be":[41],"independent":[43],"interest.":[44],"Fast":[45],"were":[49],"known":[50],"before":[51],"cover,":[54],"thoughnot":[55],"generalizations":[58],"considered":[59],"this":[61],"paper.":[62]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}