Optimal covering designs: complexity results and new bounds.
Pilu CrescenziFederico MontecalvoGianluca RossiPublished in: Discret. Appl. Math. (2004)
Keyphrases
- worst case
- upper bound
- optimal solution
- lower bound
- error tolerance
- computational complexity
- np hard
- asymptotically optimal
- space complexity
- computational cost
- objective function
- real time
- case study
- website
- approximation algorithms
- tight bounds
- support vector
- feature selection
- decision problems
- error bounds
- information systems
- optimal design
- information retrieval
- data sets