Skip to search formSkip to main contentSkip to account menu

K-approximation of k-hitting set

In computer science, k-approximation of k-hitting set is an approximation algorithm for weighted hitting set. The input is a collection S of subsets… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Approximation algorithmComputer scienceLinear programmingList of numerical analysis topics

Search for papers about K-approximation of k-hitting set

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)