Title of article
Quasi-concave functions on meet-semilattices Original Research Article
Author/Authors
Yulia Kempner، نويسنده , , Ilya Muchnik، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
492
To page
499
Abstract
This paper deals with maximization of set functions defined as minimum values of monotone linkage functions. In previous research, it has been shown that such a set function can be maximized by a greedy type algorithm over a family of all subsets of a finite set. In this paper, we extend this finding to meet-semilattices.
Keywords
Semilattice , Monotone linkage function , Closure operator , Greedy Algorithm , Quasi-concave function
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886672
Link To Document