Sign in

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives.

Pascal KunzTill FluschnikRolf NiedermeierMalte Renken
Published in: SWAT (2022)
Keyphrases
  • np hard
  • neural network
  • learning algorithm
  • optimal solution
  • feature selection
  • pattern recognition
  • dimensionality reduction
  • multidimensional scaling