Near optimal solutions for maximum quasi-bicliques

DOI10.1007/S10878-011-9392-4zbMATH Open1293.90075OpenAlexW2078103658MaRDI QIDQ2377385FDOQ2377385

Authors: Lusheng Wang 

Publication date: 28 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9392-4

Recommendations

• Near optimal solutions for maximum quasi-bicliques
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• On the maximum quasi-clique problem
• A branch-and-bound approach for maximum quasi-cliques
• An exact algorithm for the maximum quasi‐clique problem
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
• LP-based dual bounds for the maximum quasi-clique problem
• Approximating Clique and Biclique Problems
• Quasi-bicliques: Complexity and Binding Pairs

zbMATH Keywords

approximation algorithmprotein-protein interaction networksinteracting protein group pairsprotein interaction sitesquasi-bicliques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• On the closest string and substring problems
• Title not available (Why is that?)
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Finding biclusters by random projections

Cited In (5)

• Quasi-bicliques: Complexity and Binding Pairs
• Near optimal solutions for maximum quasi-bicliques
• Finding dense subgraphs with maximum weighted triangle density
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• Highly bi-connected subgraphs for computational protein function annotation

Uses Software

• iPfam

This page was built for publication: Near optimal solutions for maximum quasi-bicliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377385)