no code implementations • 9 Feb 2023 • Chen Peng, Zhengqi Dai, Guangping Xia, Yajie Niu, Yihui Lei
The challenge is that the max-support problem of $q$-consistent summary-explanation (MSqC) is much more complex than the original MS problem, resulting in over-extended solution time using standard branch-and-bound solvers.