11 citations · 25 across the 8 of their papers we have counts for
8 papers
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
Luzhi Wang, Chu-Min Li, Junping Zhou +2
This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several…
Diversified Top-k Partial MaxSAT Solving
Junping Zhou, Huanyao Sun, Feifei Ma +3
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k,…
Approximate Counting CSP Solutions Using Partition Function
Junping Zhou, Weihua Su, Minghao Yin
We propose a new approximate method for counting the number of the solutions for constraint satisfaction problem (CSP). The method derives from the partition function based on intr…
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
Jian Gao, Minghao Yin, Junping Zhou
In this paper, we investigate the hybrid tractability of binary Quantified Constraint Satisfaction Problems (QCSPs). First, a basic tractable class of binary QCSPs is identified by…
New Worst-Case Upper Bound for X3SAT
Junping Zhou, Minghao Yin
The rigorous theoretical analyses of algorithms for exact 3-satisfiability (X3SAT) have been proposed in the literature. As we know, previous algorithms for solving X3SAT have been…
New Worst-Case Upper Bound for #XSAT
Junping Zhou, Minghao Yin
An algorithm running in O(1.1995n) is presented for counting models for exact satisfiability formulae(#XSAT). This is faster than the previously best algorithm which runs in O(1.21…