Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference20 articles.
1. Nearly Tight Approximability Results for Minimum Biclique Cover and Partition;Chalermsook,2014
2. Covering graphs with few complete bipartite subgraphs
3. On Approximate Solutions for Combinatorial Optimization Problems
4. Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP;Gruber,2007
5. Contentment in graph theory: Covering graphs with cliques;Orlin,1977
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Transforming Quantified Boolean Formulas Using Biclique Covers;Tools and Algorithms for the Construction and Analysis of Systems;2023
2. On Maximising the Vertex Coverage for ${\text{Top}}-k$ t-Bicliques in Bipartite Graphs;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05