Quasi-concave functions on meet-semilattices

DOI10.1016/J.DAM.2006.12.005zbMATH Open1157.90011OpenAlexW2080495291MaRDI QIDQ2473045FDOQ2473045

Ilya B. Muchnik, Yulia Kempner

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 algorithmsemilatticequasi-concave functionclosure operatormonotone linkage function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semilattices (06A12)

Cites Work

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

Cited In (3)

• Duality between quasi-concave functions and monotone linkage functions
• Maximal closed set and half-space separations in finite closure systems
• Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm

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)