Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Rounding the Ball LP for Fair Max-Min Diversification
Julián Mestre, Lam Khai Trinh, Anthony Wirth
Given points in a metric space, partitioned into groups, , and integer quotas, , summing to , the Fair Max-Min Diversification problem asks for…
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.…