5 citations · 6 across the 6 of their papers we have counts for
11 papers · 1 filter
Submodular Maximization in Exactly Queries
Eric Balkanski, Steven DiSilvio, Alan Kuhnle +1
In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious wit…
Discretely Beyond : Guided Combinatorial Algorithms for Submodular Maximization
Yixin Chen, Ankur Nath, Chunli Peng +1
For constrained, not necessarily monotone submodular maximization, all known approximation algorithms with ratio greater than require continuous ideas, such as queries to the…
Simultaenous Sieves: A Deterministic Streaming Algorithm for Non-Monotone Submodular Maximization
Alan Kuhnle
In this work, we present a combinatorial, deterministic single-pass streaming algorithm for the problem of maximizing a submodular function, not necessarily monotone, with respect…
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
Alan Kuhnle
We consider the problem of monotone, submodular maximization over a ground set of size subject to cardinality constraint . For this problem, we introduce the first determini…
Matching reads to many genomes with the -index
Taher Mun, Alan Kuhnle, Christina Boucher +3
The -index is a tool for compressed indexing of genomic databases for exact pattern matching, which can be used to completely align reads that perfectly match some part of a gen…
Submodular Cost Submodular Cover with an Approximate Oracle
Victoria G. Crawford, Alan Kuhnle, My T. Thai
In this work, we study the Submodular Cost Submodular Cover problem, which is to minimize the submodular cost required to ensure that the submodular benefit function exceeds a give…