Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.
Bart M. P. JansenAstrid PietersePublished in: Algorithmica (2019)
Keyphrases
- data reduction
- graph coloring
- low degree
- data compression
- combinatorial problems
- job shop scheduling
- data analysis
- singular value decomposition
- preprocessing
- high dimensionality
- classification accuracy
- feature selection
- constraint satisfaction problems
- worst case
- knowledge discovery
- dimensionality reduction
- classification rules
- neural network
- phase transition
- compression algorithm
- hyper heuristics
- data mining