Login / Signup

Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems.

Viggo KannJens LagergrenAlessandro Panconesi
Published in: Inf. Process. Lett. (1996)
Keyphrases
  • neural network
  • problems involving
  • related problems
  • machine learning
  • feature selection
  • decision trees
  • three dimensional
  • optimization problems
  • logic programs
  • np complete
  • application domains
  • difficult problems