26 citations · 27 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 1 cited
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs
David S. Johnson, Lee Breslau, Ilias Diakonikolas +6
In this paper we consider two special cases of the "cover-by-pairs" optimization problem that arise when we need to place facilities so that each customer is served by two faciliti…
cs.CC2014★ 26 cited
Variable Selection is Hard
Dean Foster, Howard Karloff, Justin Thaler
Variable selection for sparse linear regression is the problem of finding, given an m x p matrix B and a target vector y, a sparse vector x such that Bx approximately equals y. Ass…
cs.DS2014
Fast Algorithms for Constructing Maximum Entropy Summary Trees
Richard Cole, Howard Karloff
Karloff? and Shirley recently proposed summary trees as a new way to visualize large rooted trees (Eurovis 2013) and gave algorithms for generating a maximum-entropy k-node summary…