37 citations · 37 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
An improved approximation algorithm for k-Median
Neal E. Young
We give a polynomial-time approximation algorithm for the (not necessarily metric) -Median problem. The algorithm is an -size-approximation algorithm for .…
cs.DS2002★ 37 cited
Polynomial-Time Approximation Scheme for Data Broadcast
Claire Kenyon, Nicolas Schabanel, Neal Young
The data broadcast problem is to find a schedule for broadcasting a given set of messages over multiple channels. The goal is to minimize the cost of the broadcast plus the expecte…