{"id":"https://openalex.org/W1490349678","doi":"https://doi.org/10.1007/978-3-540-27821-4_4","title":"Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks","display_name":"Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1490349678","doi":"https://doi.org/10.1007/978-3-540-27821-4_4","mag":"1490349678"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27821-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27821-4_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5023910624","display_name":"Piotr Berman","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Piotr Berman","raw_affiliation_strings":["Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802, USA","Dept. of Computer Science and Engineering, Pennsylvania State University, University Park, PA 16802, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Pennsylvania State University, University Park, PA 16802, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061957076","display_name":"Bhaskar DasGupta","orcid":"https://orcid.org/0000-0001-5614-5477"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar DasGupta","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago, Chicago, IL, 60607-7053, USA","Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7053, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago, Chicago, IL, 60607-7053, USA","institution_ids":["https://openalex.org/I39422238"]},{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7053, USA#TAB#","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068753451","display_name":"Eduardo D. Sontag","orcid":"https://orcid.org/0000-0001-8020-5783"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eduardo Sontag","raw_affiliation_strings":["Department of Mathematics, Rutgers University, New Brunswick, NJ, 08903, USA","Department of Mathematics, Rutgers #N#University, #N#New Brunswick, NJ 08903, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Rutgers University, New Brunswick, NJ, 08903, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Department of Mathematics, Rutgers #N#University, #N#New Brunswick, NJ 08903, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4751,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.88824188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"50"},"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.9993000030517578,"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.9993000030517578,"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.989300012588501,"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.9889000058174133,"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/randomized-rounding","display_name":"Randomized rounding","score":0.7131447196006775},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7090451121330261},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6483730673789978},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6209579110145569},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6160215139389038},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5628519058227539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5554689168930054},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5059975981712341},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4889136850833893},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46724867820739746},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.462709903717041},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4569128453731537},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4384005665779114},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.41688936948776245},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3917276859283447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20005735754966736}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.7131447196006775},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7090451121330261},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6483730673789978},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6209579110145569},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6160215139389038},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5628519058227539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5554689168930054},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5059975981712341},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4889136850833893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46724867820739746},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.462709903717041},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4569128453731537},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4384005665779114},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.41688936948776245},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3917276859283447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20005735754966736},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-27821-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27821-4_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W92982764","https://openalex.org/W637887103","https://openalex.org/W1515001052","https://openalex.org/W2001431571","https://openalex.org/W2004906368","https://openalex.org/W2011039300","https://openalex.org/W2040924621","https://openalex.org/W2042587503","https://openalex.org/W2068871408","https://openalex.org/W2110070747","https://openalex.org/W2139439234","https://openalex.org/W2143996311","https://openalex.org/W2149325066","https://openalex.org/W2161278885","https://openalex.org/W2295428206","https://openalex.org/W2611147814","https://openalex.org/W2611804663","https://openalex.org/W4231916799","https://openalex.org/W4231930488","https://openalex.org/W4240381901"],"related_works":["https://openalex.org/W2099734427","https://openalex.org/W2597665901","https://openalex.org/W1916943706","https://openalex.org/W3194194247","https://openalex.org/W2378974797","https://openalex.org/W2960420609","https://openalex.org/W2163141979","https://openalex.org/W1482900401","https://openalex.org/W1490349678","https://openalex.org/W2606290293"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":3}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}