Near optimal solutions for maximum quasi-bicliques

DOI10.1007/978-3-642-14031-0_44MaRDI QIDQ3578341zbMATH OpenOpenAlexFDO

Authors Lusheng Wang

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14031-0_44

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Biochemistry, molecular biology (92C40)

Recommendations

• Near optimal solutions for maximum quasi-bicliques
• Quasi-bicliques: Complexity and Binding Pairs
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• A branch-and-bound approach for maximum quasi-cliques
• Approximating Clique and Biclique Problems

Cited in

(7)

• A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities
• Algorithms for induced biclique optimization problems
• General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
• Near optimal solutions for maximum quasi-bicliques
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• Quasi-bicliques: Complexity and Binding Pairs
• New heuristic approaches for maximum balanced biclique problem

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 Q3578341)