Instance-Specific Accelerators for Minimum Covering
Christian Plessl, Marco Platzner · 2001
Abstract In this paper we present instance-specific accelerators for minimum-cost covering problems. We first define the covering problem and discuss a branch & bound algorithm to solve it. Then we describe an instance-specific hardware architecture that implements branch & bound in 3-valued logic and uses reduction techniques usually found in software solvers. Results for small unate covering problems reveal significant raw speedups.