Search Results for author:
Found 1 papers, 0 papers with code
Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity
We provide a parallel algorithm with a time complexity over $n$ processors of $\mathcal{O}(n^2g) +\mathcal{O}(\log{\log{n}})$ where $n$ is the cardinality of the ground set and $g$ is the complexity to compute the monotone linkage function that induces a corresponding quasi-concave set function via a duality.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
