31 citations · 68 across the 7 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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.LG2016
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…