Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Ben-Gurion University Research Portal
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs
The clustering matroid and the optimal clustering tree
Ephraim Korach
, Michal Stern
Department of Industrial Engineering and Management
Research output
:
Contribution to journal
›
Article
›
peer-review
43
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The clustering matroid and the optimal clustering tree'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Matroid
100%
Optimal Clustering
100%
Cluster-tree
100%
Motivation
20%
Greedy Algorithm
20%
Complete Graph
20%
Polynomial-time Algorithm
20%
Minimum Cost
20%
Communication Cost
20%
Cardinality
20%
Polyhedron
20%
Convex Hull
20%
Feasible Solution
20%
Tree Network
20%
Linear Algorithm
20%
Fault Tolerance
20%
Communication Tree
20%
Disjoint Groups
20%
Group Privacy
20%
Minimum Cost Spanning Tree
20%
Mathematics
Clustering
100%
Matroid
100%
Greedy Algorithm
20%
Edge
20%
Complete Graph
20%
Polynomial
20%
Cardinality
20%
Polyhedron
20%
Convex Hull
20%
Feasible Solution
20%
Tree Network
20%
Spanning Tree
20%