3 citations · 3 across the 2 of their papers we have counts for
3 papers · 1 filter
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
Jie Gao, Mayank Goswami, Karthik C. S. +3
There has been a long-standing interest in computing diverse solutions to optimization problems. Motivated by reallocation of governmental institutions in Sweden, in 1995 J. Krarup…
Streaming Complexity of Spanning Tree Computation
Yi-Jun Chang, Martin Farach-Colton, Tsan-Sheng Hsu +1
The semi-streaming model is a variant of the streaming model frequently used for the computation of graph problems. It allows the edges of an -node input graph to be read sequen…
Optimal Ball Recycling
Michael A. Bender, Jake Christensen, Alex Conway +3
Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined…