New reduction rule: BinaryMatrixFactorization to BicliqueCover

src/models/BMF.jl

@@ -18,7 +18,7 @@ The Boolean Matrix Factorization (BMF) problem is defined on a binary matrix A i
 struct BinaryMatrixFactorization<: AbstractProblem
     A::BitMatrix
     k::Int
-    function BinaryMatrixFactorization(A::BitMatrix, k::Int) where K
+    function BinaryMatrixFactorization(A::BitMatrix, k::Int)
         new(A, k)
     end
 end

src/models/BicliqueCover.jl

@@ -35,7 +35,7 @@
 # Variables Interface
 # each vertex is assigned to a biclique, with k bicliques, variables(c::BicliqueCover) = fill(1,c.k * nv(c.graph)) 
 num_variables(c::BicliqueCover) = nv(c.graph) * c.k
-num_flavors(c::BicliqueCover) = 2
+num_flavors(::Type{BicliqueCover{Int64}}) = 2
 
 # constraints interface
 function constraints(c::BicliqueCover)
@@ -46,6 +46,7 @@
 end
 # solution_size function for BicliqueCover, the solution size is the sum of the weights of the bicliques
 function solution_size_multiple(c::BicliqueCover, configs)
+    print(configs)
     @assert all(length(config) <= c.k for config in configs)
     return map(configs) do config
         return SolutionSize(sum(i -> count(k -> k ==1, i),config), is_biclique_cover(c,config))

src/rules/BMF_BicliqueCover.jl

@@ -0,0 +1,30 @@
+"""
+$TYPEDEF
+
+The reduction result from BinaryMatrixFactorization to BicliqueCover.
+
+### Fields
+- `bicliquecover`: The BicliqueCover problem.
+- `k`: The number of bicliques.
+"""
+struct BMF_BicliqueCover{Int64} <: AbstractReductionResult
+    bicliquecover::BicliqueCover{Int64}
+    k::Int64
+end
+Base.:(==)(a::BMF_BicliqueCover, b::BMF_BicliqueCover) = a.bicliquecover == b.bicliquecover && a.k == b.k
+target_problem(res::BMF_BicliqueCover) = res.bicliquecover
+
+function reduceto(::Type{BicliqueCover}, bmf::BinaryMatrixFactorization)
+    k = bmf.k
+    A = Int.(bmf.A)
+    return BMF_BicliqueCover(ProblemReductions.biclique_cover_from_matrix(A, k), k)
+end
+
+# Not implemented
+function extract_solution(res::BMF_BicliqueCover, solution::Vector{Vector{Int64}})
+    return solution
+end
+
+function extract_multiple_solutions(res::BMF_BicliqueCover, solution_set)
+    return unique(extract_solution.(Ref(res), solution_set))
+end

src/rules/rules.jl

@@ -88,4 +88,5 @@ include("sat_dominatingset.jl")
 include("independentset_setpacking.jl")
 include("circuit_sat.jl")
 include("vertexcovering_independentset.jl")
-include("matching_setpacking.jl")
+include("matching_setpacking.jl")
+include("BMF_BicliqueCover.jl")

test/rules/BMF_BicliqueCover.jl

@@ -0,0 +1,13 @@
+using Test, ProblemReductions, Graphs
+
+@testset "BMF_BicliqueCover" begin
+    A = [1 0 ; 1 1]
+    A = BitMatrix(A)
+    bmf1 = BinaryMatrixFactorization(A, 2)
+    bc1 = ProblemReductions.biclique_cover_from_matrix(Int.(A), 2)
+    res = reduceto(BicliqueCover, bmf1)
+    @test res.k == 2
+    @test res.bicliquecover == bc1
+    @test res.bicliquecover.part1 == [i for i in 1:size(A,1)]
+    @test target_problem(res) == bc1
+end

test/rules/rules.jl

@@ -52,6 +52,10 @@ end
     include("matching_setpacking.jl")
 end
 
+@testset "BMF_BicliqueCover" begin
+    include("BMF_BicliqueCover.jl")
+end
+
 @testset "rules" begin
     circuit = CircuitSAT(@circuit begin
         x = a ∨ ¬b