Algorithms for the boundary selection problem

DOI10.1007/BF02522823zbMATH Open0865.68041OpenAlexW1987823569MaRDI QIDQ675310FDOQ675310

Vijay Raghavan, J. N. Bhuyan, Jitender Deogun

Publication date: 30 June 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02522823

Recommendations

• Evaluation of a Branch and Bound Algorithm for Clustering
• scientific article; zbMATH DE number 1305391
• The Star Clustering Algorithm for Static and Dynamic Information Organization
• The new boundary sample selection method and its application in the text classification
• scientific article; zbMATH DE number 1559578

zbMATH Keywords

branch-and-boundGreedy algorithmBoundary Selection Problemclustering schemes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Title not available (Why is that?)
• On Grouping for Maximum Homogeneity
• Title not available (Why is that?)

Cited In (1)

• Algorithms for Multi-Criteria Boundary Labeling

This page was built for publication: Algorithms for the boundary selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675310)