Layered clusters of tightness set functions

DOI10.1016/S0893-9659(01)00109-4zbMath1019.90034MaRDI QIDQ1609443

Ilya B. Muchnik, Boris G. Mirkin

Publication date: 15 August 2002

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

greedy optimizationlayered clustermonotone linkage

Mathematics Subject Classification ID

Applications of graph theory (05C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Supercluster in Statics and Dynamics: An Approximate Structure Imitating a Rough Set ⋮ Quasi-concave functions on meet-semilattices ⋮ Duality between quasi-concave functions and monotone linkage functions ⋮ Combinatorial optimization in system configuration design ⋮ Clustering as an Approach to 3D Reconstruction Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Greedoids
• Analysis of the distribution of functions in an organization
• Extremal subsystems of monotonic systems. II
• Extremal subsystems of monotonic systems. I
• Monotone linkage clustering and quasi-concave set functions
• Well-layered maps---a class of greedily optimizable set functions

This page was built for publication: Layered clusters of tightness set functions