31 citations · 68 across the 7 of their papers we have counts for
3 papers · 1 filter
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…
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…
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…