1 citations · 2 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
A Better-than-2 Approximation for k-Median Part I: The Power of General Bids
Rares-Darius Buhai, Vincent Cohen-Addad, Henry Fleischmann +6
The Greedy algorithm of Jain, Mahdian, Markakis, Saberi, and Vazirani was the best Lagrangian-multiplier-preserving (LMP) approximation algorithm for facility location, and thus th…
cs.DS2023
Spanning Adjacency Oracles in Sublinear Time
Greg Bodwin, Henry Fleischmann
Suppose we are given an -node, -edge input graph , and the goal is to compute a spanning subgraph on edges. This can be achieved in linear time via b…