3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 3 cited
Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs
Neal E. Young
We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing/covering linear programs, and for (non-metric) fractional facility location. We…
cs.DS2010
A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls
Neal E. Young
We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We d…