6 citations · 9 across the 7 of their papers we have counts for
7 papers · 1 filter
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem
Dorit S. Hochbaum, Xu Rao
The Replenishment Storage problem (RSP) is to minimize the storage capacity requirement for a deterministic demand, multi-item inventory system where each item has a given reorder…
Algorithms and Complexity for Variants of Covariates Fine Balance
Dorit S. Hochbaum, Asaf Levin, Xu Rao
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive c…
Network Flow Methods for the Minimum Covariates Imbalance Problem
Dorit S. Hochbaum, Xu Rao
The problem of balancing covariates arises in observational studies where one is given a group of control samples and another group, disjoint from the control group, of treatment s…
Solving -Stable Instances of k-Terminal Cut with Isolating Cuts
Mark Velednitsky
The k-Terminal Cut problem, also known as the Multiway Cut problem, is defined on an edge-weighted graph with distinct vertices called "terminals." The goal is to remove a mini…
Algorithms and Complexity of Range Clustering
Dorit S. Hochbaum
We introduce a novel criterion in clustering that seeks clusters with limited range of values associated with each cluster's elements. In clustering or classification the objective…
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Minjun Chang, Dorit S. Hochbaum, Quico Spaen +1
This work presents an optimally-competitive algorithm for the problem of maximum weighted online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given a kn…