An application of limited branching in clustering

  • Authors:

  • Mirko Kivánek

  • Affiliations:

  • Research Institute of Mathematical Machines, Loretánské nám. 3, 118 55 Praha 1, Czechoslovakia

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.10

Visualization

Abstract

The technique of limited branching is used to answer an open problem of P. Brucker (1977) arising in a study of computational complexity of clustering problems. This problem is shown to be solvable by a polynomial algorithm.