activity
20032021
most citedQuasi-concave functions on antimatroids

3 citations · 7 across the 7 of their papers we have counts for

collaborators

8 papers

math.OC2021

Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity

Praneeth Vepakomma, Yulia Kempner, Ramesh Raskar

Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for comb…

math.CO2021★ 1 cited

Cospanning characterizations of violator and co-violator spaces

Yulia Kempner, Vadim E. Levit

Given a finite set E and an operator sigma:2^{E}-->2^{E}, two subsets X,Y of the ground set E are cospanning if sigma(X)=sigma(Y) (Korte, Lovasz, Schrader; 1991). We investigate co…

stat.ME2017

Combinatorics of Distance Covariance: Inclusion-Minimal Maximizers of Quasi-Concave Set Functions for Diverse Variable Selection

Praneeth Vepakomma, Yulia Kempner

In this paper we show that the negative sample distance covariance function is a quasi-concave set function of samples of random variables that are not statistically independent. W…

math.CO2016

Violator spaces vs closure spaces

Yulia Kempner, Vadim E. Levit

Violator Spaces were introduced by J. Matousek et al. in 2008 as generalization of Linear Programming problems. Convex geometries were invented by Edelman and Jamison in 1985 as pr…

math.CO2008★ 1 cited

Duality between quasi-concave functions and monotone linkage functions

Yulia Kempner, Vadim E. Levit

A function defined on all subsets of a finite ground set is quasi-concave if for all . Quasi-concave functions arise in many…

math.CO2008★ 2 cited

Geometry of antimatroidal point sets

Yulia Kempner, Vadim E. Levit

The notion of "antimatroid with repetition" was conceived by Bjorner, Lovasz and Shor in 1991 as a multiset extension of the notion of antimatroid. When the underlying set consists…

math.CO2004★ 3 cited

Quasi-concave functions on antimatroids

Vadim E. Levit, Yulia Kempner

In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories:…

math.CO2003

Correspondence Between Two Antimatroid Algorithmic Characterizations

Yulia Kempner, Vadim E. Levit

The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great imp…