Quasi-concave functions on meet-semilattices
From MaRDI portal
Publication:2473045
Recommendations
- Duality between quasi-concave functions and monotone linkage functions
- Monotone linkage clustering and quasi-concave set functions
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
- Generalized convex set functions
- On the problem of maximizing a modular function in the geometric lattice
Cites work
- scientific article; zbMATH DE number 5287125 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1163872 (Why is no real title available?)
- A fast algorithm for finding matching responses in a survey data table
- Combinatorial representation and convex dimension of convex geometries
- Correspondence between two antimatroid algorithmic characterizations
- Extremal subsystems of monotonic systems. I
- Functional dependencies in relational databases: A lattice point of view
- Greedoids
- Incomplete classifications of a finite set of objects using monotone systems
- Induced layered clusters, hereditary mappings, and convex geometries
- Introduction to Greedoids
- Layered clusters of tightness set functions
- Matroids and the greedy algorithm
- Monotone linkage clustering and quasi-concave set functions
- Nuclei of monotonic systems on a semilattice of sets
- The theory of convex geometries
Cited in
(3)
This page was built for publication: Quasi-concave functions on meet-semilattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473045)