11 citations · 16 across the 5 of their papers we have counts for
6 papers
Multipass Linear Sketches for Geometric LP-Type Problems
N. Efe Çekirge, William Gay, David P. Woodruff
LP-type problems such as the Minimum Enclosing Ball (MEB), Linear Support Vector Machine (SVM), Linear Programming (LP), and Semidefinite Programming (SDP) are fundamental combinat…
Online Ad Allocation with Predictions
Fabian Spaeh, Alina Ene
Display Ads and the generalized assignment problem are two well-studied online packing problems with important applications in ad allocation and other areas. In both problems, ad i…
Routing under Balance
Alina Ene, Gary Miller, Jakub Pachocki +1
We introduce the notion of balance for directed graphs: a weighted directed graph is -balanced if for every cut , the total weight of edges going from to $V\s…
Online Buy-at-Bulk Network Design
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy +1
We present the first non-trivial online algorithms for the non-uniform, multicommodity buy-at-bulk (MC-BB) network design problem in undirected and directed graphs. Our competitive…
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small
Alina Ene, Sariel Har-Peled, Benjamin Raichel
We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter problem. In the \lbc problem, we are given a set of p…
Geometric Packing under Non-uniform Constraints
Alina Ene, Sariel Har-Peled, Benjamin Raichel
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the reg…