A polynomial-time (n / Õ((log n)^3))-approximation algorithm for Maximum Balanced Biclique that improves the previous (n / Ω((log n)^2)) bound and matches the maximum clique approximation up to an O(log log n) factor.
Interactive proofs and the hardness of approximating cliques
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Approximation Algorithm for Maximum Balanced Biclique
A polynomial-time (n / Õ((log n)^3))-approximation algorithm for Maximum Balanced Biclique that improves the previous (n / Ω((log n)^2)) bound and matches the maximum clique approximation up to an O(log log n) factor.