Results 1  10
of
106
Density functions subject to a comatroid constraint
 CoRR
"... In this paper we consider the problem of finding the densest subset subject to comatroid constraints. We are given a monotone supermodular set function f defined over a universe U, and the density of a subset S is defined to be f(S)/S. This generalizes the concept of graph density. Comatroid con ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we consider the problem of finding the densest subset subject to comatroid constraints. We are given a monotone supermodular set function f defined over a universe U, and the density of a subset S is defined to be f(S)/S. This generalizes the concept of graph density. Comatroid
Adaptive submodular optimization under matroid constraints
, 2011
"... Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorithm is guaranteed to obtain nearoptimal solutions. In this article, we extend this classic result to a general class of ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorithm is guaranteed to obtain nearoptimal solutions. In this article, we extend this classic result to a general class
Online submodular maximization under a matroid constraint . . .
, 2014
"... Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize the value of the ranking? These applications exhibit strong diminishing returns: Redundancy decreases the marginal utility of each ad or information source ..."
Abstract
 Add to MetaCart
information cascades. Finally, we present a second algorithm that handles the more general case in which the feasible sets are given by a matroid constraint, while still maintaining a 1 − 1/e asymptotic performance ratio.
Covering Intersecting Biset Families Under Matroid Constraints
, 2013
"... Edmonds' fundamental theorem on arborescences [4] characterizes the existence of k pairwise edgedisjoint arborescences with the same root in a directed graph. In [9], Lovász gave an elegant alternative proof which became the base of many extensions of Edmonds' result. In this paper, we u ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
use a modification of Lovász' method to prove a theorem on covering intersecting biset families under matroid constraints. Our result can be considered as a common generalization of previous results on packing arborescences.
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
, 2012
"... We present an optimal, combinatorial 11/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pal and Vondrak, 2008), our algorithm is extremely simple and requires no rounding. It consists of the g ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We present an optimal, combinatorial 11/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pal and Vondrak, 2008), our algorithm is extremely simple and requires no rounding. It consists
Maximizing a Monotone Submodular Function subject to a Matroid Constraint
, 2008
"... Let f: 2 X → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2 approximation [14] for this problem. For certain special cases, e.g. max S≤k f(S), the greedy algorithm yields a (1 − 1/e)app ..."
Abstract

Cited by 62 (0 self)
 Add to MetaCart
Let f: 2 X → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2 approximation [14] for this problem. For certain special cases, e.g. max S≤k f(S), the greedy algorithm yields a (1 − 1/e
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
, 2012
"... Consider the following online version of the submodular maximization problem under a matroid constraint: We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset that remains independent in the matroid over time. At each time, a new weighted ran ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Consider the following online version of the submodular maximization problem under a matroid constraint: We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset that remains independent in the matroid over time. At each time, a new weighted
Rootedtree decompositions with matroid constraints and infinitesimal rigidity of frameworks with boundaries
, 2011
"... ..."
Results 1  10
of
106