3 papers
cs.DS2026
A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
Philip Cervenjak, Junhao Gan, Naonori Kakimura +2
Connected Submodular Maximization (CSM) is a graph problem with important applications to wireless network deployment, path planning, epidemic outbreaks, and cancer genome studies.…
cs.DS2024
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
Philip Cervenjak, Junhao Gan, Seeun William Umboh +1
We consider the Max Unique Coverage problem, including applications to the data stream model. The input is a universe of elements, a collection of subsets of this universe,…
cs.DS2023
Fast Parallel Algorithms for Submodular -Superseparable Maximization
Philip Cervenjak, Junhao Gan, Anthony Wirth
Maximizing a non-negative, monontone, submodular function over elements under a cardinality constraint (SMCC) is a well-studied NP-hard problem. It has important applic…