• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

NP-Hardness of balanced minimum sum-of-squares clustering.

Artem V. PyatkinDaniel AloiseNenad Mladenovic
Published in: Pattern Recognit. Lett. (2017)
Keyphrases
  • np hardness
  • np hard
  • worst case analysis
  • mixed integer
  • approximation algorithms
  • locally optimal
  • discrete tomography
  • lower bound
  • scheduling problem
  • linear programming
  • parameter estimation
  • dynamic systems