Quasi-concave functions on meet-semilattices

DOI10.1016/j.dam.2006.12.005zbMath1157.90011OpenAlexW2080495291MaRDI QIDQ2473045

Yulia Kempner, Ilya B. Muchnik

Publication date: 26 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.12.005

zbMATH Keywords

greedy algorithmclosure operatorsemilatticequasi-concave functionmonotone linkage function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semilattices (06A12)

Related Items (2)

Duality between quasi-concave functions and monotone linkage functions ⋮ Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedoids
• Nuclei of monotonic systems on a semilattice of sets
• Incomplete classifications of a finite set of objects using monotone systems
• The theory of convex geometries
• Combinatorial representation and convex dimension of convex geometries
• Functional dependencies in relational databases: A lattice point of view
• Extremal subsystems of monotonic systems. I
• Monotone linkage clustering and quasi-concave set functions
• A fast algorithm for finding matching responses in a survey data table
• Correspondence between two antimatroid algorithmic characterizations
• Layered clusters of tightness set functions
• Induced layered clusters, hereditary mappings, and convex geometries
• Introduction to Greedoids
• Matroids and the greedy algorithm

This page was built for publication: Quasi-concave functions on meet-semilattices