Solving the maximum edge biclique packing problem on unbalanced bipartite graphs

DOI10.1016/j.dam.2011.09.019zbMath1321.05195OpenAlexW2061584385WikidataQ57707466 ScholiaQ57707466MaRDI QIDQ496657

Eduardo Moreno, Alexandre S. Freire, Carlos E. Ferreira, Vicente Acuña

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.019

zbMATH Keywords

branch-and-pricemetabolic networksproduct bundlingmaximum edge biclique packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Scale reduction techniques for computing maximum induced bicliques ⋮ Parameterized algorithms for edge biclique and related problems ⋮ Unnamed Item ⋮ On Problem of Finding all Maximal Induced Bicliques of Hypergraph ⋮ An Integer Programming Formulation for the Maximum k-Subset Intersection Problem ⋮ Parameterized Algorithms for Maximum Edge Biclique and Related Problems ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs

Uses Software

• DIMACS
• MaxCliqueDyn
• efmtool

Cites Work

• On the complexity of approximating the independent set problem
• An exact algorithm for IP column generation
• The maximum edge biclique problem is NP-complete
• A fast algorithm for the maximum clique problem
• Biclique completion problems for multicast network design
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Finding Maximum Edge Bicliques in Convex Bipartite Graphs
• Relations between average case complexity and approximation complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the maximum edge biclique packing problem on unbalanced bipartite graphs