6 citations · 7 across the 2 of their papers we have counts for
3 papers
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…
Online Sparse Linear Regression
Dean Foster, Satyen Kale, Howard Karloff
We consider the online sparse linear regression problem, which is the problem of sequentially making predictions observing only a limited number of features in each round, to minim…
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
Howard Karloff, Flip Korn, Konstantin Makarychev +1
This paper studies the "explanation problem" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tre…