Algorithms for the boundary selection problem

DOI10.1007/BF02522823MaRDI QIDQ675310zbMATH OpenOpenAlexFDO

Authors J. N. Bhuyan, Jitender Deogun, Vijay Raghavan

Publication date 30 June 1997

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-boundGreedy algorithmBoundary Selection Problemclustering schemes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

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

Cites work

• scientific article; zbMATH DE number 3972229 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• On Grouping for Maximum Homogeneity

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)