6 citations · 9 across the 6 of their papers we have counts for
6 papers
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…
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees
Jonathan Bodine, Dorit S. Hochbaum
Decision trees are a widely used method for classification, both by themselves and as the building blocks of multiple different ensemble learning methods. The Max-Cut decision tree…
Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm
Bala G. Chandran, Dorit S. Hochbaum
We show that the pseudoflow algorithm for maximum flow is particularly efficient for the bipartite matching problem both in theory and in practice. We develop several implementatio…
Benchmark Problems for Totally Unimodular Set System Auction
Ilan Adler, Dorit S. Hochbaum
We consider a generalization of the -flow set system auction where the set to be procured by a customer corresponds to a feasible solution to a linear programming problem where…