Pages that link to "Item:Q1430285"

The following pages link to Approximation algorithms for the class cover problem (Q1430285):

Displaying 14 items.

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