Combinatorial optimization (CO) aims to efficiently find the best soluti...
For general-sum, n-player, strategic games with transferable utility, th...
The development of parallelizable algorithms for monotone, submodular
ma...
For the problem of maximizing a monotone, submodular function with respe...
For the problem of maximizing a nonnegative, (not necessarily monotone)
...
In this work, we present a combinatorial, deterministic single-pass stre...
We consider the problem of monotone, submodular maximization over a grou...
We study parallelizable algorithms for maximization of a submodular func...
The r-index is a tool for compressed indexing of genomic databases for
e...
We study the monotone, weakly submodular maximization problem (WSM), whi...
In this work, we study the Submodular Cost Submodular Cover problem, whi...
In this work, we consider the maximization of submodular functions
const...
In this work, we consider the maximization of submodular functions
const...
A deterministic, nearly linear-time, approximation algorithm
FastInterla...
While short read aligners, which predominantly use the FM-index, are abl...
The optimization of submodular functions on the integer lattice has rece...