{"id":"https://openalex.org/W2808027536","doi":"https://doi.org/10.3390/a11060084","title":"Efficient Approximation for Restricted Biclique Cover Problems","display_name":"Efficient Approximation for Restricted Biclique Cover Problems","publication_year":2018,"publication_date":"2018-06-12","ids":{"openalex":"https://openalex.org/W2808027536","doi":"https://doi.org/10.3390/a11060084","mag":"2808027536"},"language":"en","primary_location":{"id":"doi:10.3390/a11060084","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a11060084","pdf_url":"https://www.mdpi.com/1999-4893/11/6/84/pdf?version=1528794890","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/11/6/84/pdf?version=1528794890","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037972828","display_name":"Alessandro Epasto","orcid":"https://orcid.org/0000-0003-0456-3217"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alessandro Epasto","raw_affiliation_strings":["Google Research, New York, NY 10011, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, New York, NY 10011, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028869858","display_name":"Eli Upfal","orcid":"https://orcid.org/0000-0002-9321-9460"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Upfal","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, RI 02912, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI 02912, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037972828"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2019,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.52355375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"6","first_page":"84","last_page":"84"},"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.9954000115394592,"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.9954000115394592,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10096","display_name":"Metal-Organic Frameworks: Synthesis and Applications","score":0.9485999941825867,"subfield":{"id":"https://openalex.org/subfields/1604","display_name":"Inorganic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"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.8731694221496582},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.8455873727798462},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.715466320514679},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5879015326499939},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.462406188249588},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45180973410606384},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45127952098846436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4392988681793213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25902754068374634}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8731694221496582},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.8455873727798462},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.715466320514679},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5879015326499939},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.462406188249588},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45180973410606384},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45127952098846436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4392988681793213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25902754068374634},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a11060084","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a11060084","pdf_url":"https://www.mdpi.com/1999-4893/11/6/84/pdf?version=1528794890","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:4a4904d85b42492cb1d876ac2c3f1b10","is_oa":true,"landing_page_url":"https://doaj.org/article/4a4904d85b42492cb1d876ac2c3f1b10","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 11, Iss 6, p 84 (2018)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/11/6/84/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a11060084","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a11060084","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a11060084","pdf_url":"https://www.mdpi.com/1999-4893/11/6/84/pdf?version=1528794890","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1655007426","display_name":null,"funder_award_id":"1247581","funder_id":"https://openalex.org/F4320320373","funder_display_name":"National Stroke Foundation"}],"funders":[{"id":"https://openalex.org/F4320320373","display_name":"National Stroke Foundation","ror":"https://ror.org/004ckc033"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808027536.pdf","grobid_xml":"https://content.openalex.org/works/W2808027536.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1508674555","https://openalex.org/W1520221852","https://openalex.org/W1548178949","https://openalex.org/W1882281809","https://openalex.org/W1982055078","https://openalex.org/W1986774830","https://openalex.org/W2024380444","https://openalex.org/W2040570634","https://openalex.org/W2054926952","https://openalex.org/W2065163038","https://openalex.org/W2076928277","https://openalex.org/W2092636529","https://openalex.org/W2109291623","https://openalex.org/W2116453796","https://openalex.org/W2152486369","https://openalex.org/W2160342152","https://openalex.org/W2166502815","https://openalex.org/W2492608700"],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W2091826982","https://openalex.org/W4400909662","https://openalex.org/W2921162226","https://openalex.org/W2036057584","https://openalex.org/W3022526073","https://openalex.org/W4246000090","https://openalex.org/W2405987656","https://openalex.org/W2107875203","https://openalex.org/W4234658180"],"abstract_inverted_index":{"Covering":[0],"the":[1,49,52,59,65,75,90,97,108,115,120,139,158,216,229,241,250],"edges":[2],"of":[3,11,34,37,55,64,89,92,122,173,186,208,228,231,240,249],"a":[4,8,17,35,43,86,124,171,182,193,211],"bipartite":[5,12,194],"graph":[6,19,195],"by":[7,58,111,181,192],"minimum":[9,66],"set":[10,36,172,230],"complete":[13],"graphs":[14],"(bicliques)":[15],"is":[16,28,70,135,141,190,202,254],"basic":[18],"theoretic":[20],"problem,":[21,109],"with":[22,238],"numerous":[23],"applications.":[24,113],"In":[25,99,114,144],"particular,":[26],"it":[27],"used":[29],"to":[30,42,107,152,169,204,210,225,256],"characterize":[31],"parsimonious":[32],"models":[33],"observations":[38,50],"(each":[39],"biclique":[40,67,251],"corresponds":[41,168],"factor":[44,88],"or":[45],"feature":[46],"that":[47,131,148,245],"relates":[48],"in":[51,81,96,200,218],"two":[53,104,156],"sets":[54],"nodes":[56,93,150,217],"connected":[57],"biclique).":[60],"The":[61,163,188],"decision":[62],"version":[63,248],"cover":[68,76,252],"problem":[69,140,159,253],"NP-Complete,":[71],"and":[72],"unless":[73],"P=NP,":[74],"size":[77,239],"cannot":[78],"be":[79],"approximated":[80],"general":[82],"within":[83],"less":[84],"than":[85,155],"sub-linear":[87],"number":[91,121,134,185],"(or":[94],"edges)":[95],"graph.":[98,242],"this":[100,133,246],"work,":[101],"we":[102,118,146,166],"consider":[103,167],"natural":[105],"restrictions":[106],"motivated":[110],"practical":[112,247],"first":[116],"case,":[117],"restrict":[119],"bicliques":[123],"node":[125,199],"can":[126,236],"belong":[127,151],"to.":[128],"We":[129,243],"show":[130,147,244],"when":[132,149],"at":[136],"least":[137],"5,":[138],"still":[142],"NP-hard.":[143],"contrast,":[145],"no":[153],"more":[154],"bicliques,":[157],"has":[160],"efficient":[161,257],"approximations.":[162,258],"second":[164],"model":[165,189],"observing":[170],"independent":[174,221],"samples":[175],"from":[176],"an":[177,205],"unknown":[178],"model,":[179],"governed":[180],"possibly":[183],"large":[184],"factors.":[187],"defined":[191],"G=(L,R,E),":[196],"where":[197,234],"each":[198],"L":[201],"assigned":[203,224],"arbitrary":[206],"subset":[207],"up":[209],"constant":[212],"f":[213],"factors,":[214],"while":[215],"R":[219],"(the":[220],"observations)":[222],"are":[223],"random":[226],"subsets":[227],"k":[232,235],"factors":[233],"grow":[237],"amenable":[255]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}