Approximation algorithms for the class cover problem

DOI10.1023/B:AMAI.0000012867.03976.a5zbMath1075.68609OpenAlexW1974131786MaRDI QIDQ1430285

Adam H. Cannon, Lenore J. Cowen

Publication date: 27 May 2004

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:amai.0000012867.03976.a5

zbMATH Keywords

classificationapproximation algorithmsmargin classifierset coverdisk cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (14)

Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions ⋮ The class cover problem with boxes ⋮ Computing optimal islands ⋮ Edge density of new graph types based on a random digraph family ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ The distribution of the relative arc density of a family of interval catch digraph based on uniform data ⋮ A new family of proximity graphs: class cover catch digraphs ⋮ A CLT for a one-dimensional class cover problem ⋮ On the distribution of the domination number for random class cover catch digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Prototype selection for interpretable classification ⋮ Classification using proximity catch digraphs ⋮ Characterizing the scale dimension of a high-dimensional classification problem ⋮ Law of large numbers for a two-dimensional class cover problem

This page was built for publication: Approximation algorithms for the class cover problem