1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2008
Linear Kernelizations for Restricted 3-Hitting Set Problems
Xuan Cai
The 3-\textsc{Hitting Set} problem is also called the \textsc{Vertex Cover} problem on 3-uniform hypergraphs. In this paper, we address kernelizations of the \textsc{Vertex Cover}…
cs.DS2008★ 1 cited
Canonical Coin Systems for Change-Making Problems
Xuan Cai
The Change-Making Problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Neverthe…