Search Results for author:
Found 2 papers, 0 papers with code
Diverse Collections in Matroids and Graphs
The input to the Weighted Diverse Bases problem consists of a matroid $M$, a weight function $\omega:E(M)\to\mathbb{N}$, and integers $k\geq 1, d\geq 0$.
Data Structures and Algorithms
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems
The new constrained clustering problem encompasses a number of problems and by solving it, we obtain the first linear time-approximation schemes for a number of well-studied fundamental problems concerning clustering of binary vectors and low-rank approximation of binary matrices.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
