Dorit S. Hochbaum

is this you? claim profile

∙ 0 followers
berkeley college

Professor, Industrial Engineering and Operations Research

Featured Co-authors

Yu Ding
21 publications
Sheng Liu
20 publications
Asaf Levin
12 publications
Mark Velednitsky
5 publications
Quico Spaen
3 publications
Xu Rao
3 publications
Ahmed Aziz Ezzat
2 publications
Minjun Chang
2 publications
Barak Fishbain
1 publication
Stefan Mueller
1 publication
Jonathan Bodine
1 publication

Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition

An important problem in decision theory concerns the aggregation of indi...
01/12/2021 ∙ by Dorit S. Hochbaum, et al. ∙ 2 ∙ share

read it
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem

The Replenishment Storage problem (RSP) is to minimize the storage capac...
10/04/2020 ∙ by Dorit S. Hochbaum, et al. ∙ 0 ∙ share

read it
Algorithms and Complexity for Variants of Covariates Fine Balance

We study here several variants of the covariates fine balance problem wh...
09/17/2020 ∙ by Dorit S. Hochbaum, et al. ∙ 0 ∙ share

read it
Network Flow Methods for the Minimum Covariates Imbalance Problem

The problem of balancing covariates arises in observational studies wher...
07/14/2020 ∙ by Dorit S. Hochbaum, et al. ∙ 0 ∙ share

read it
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees

Decision trees are a widely used method for classification, both by them...
06/25/2020 ∙ by Jonathan Bodine, et al. ∙ 0 ∙ share

read it
Spatial Pattern Recognition with Adjacency-Clustering: Improved Diagnostics for Semiconductor Wafer Bin Maps

In semiconductor manufacturing, statistical quality control hinges on an...
06/24/2020 ∙ by Ahmed Aziz Ezzat, et al. ∙ 0 ∙ share

read it
Algorithms and Complexity of Range Clustering

We introduce a novel criterion in clustering that seeks clusters with li...
05/14/2018 ∙ by Dorit S. Hochbaum, et al. ∙ 0 ∙ share

read it
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals

This work presents the first algorithm for the problem of weighted onlin...
05/05/2018 ∙ by Minjun Chang, et al. ∙ 0 ∙ share

read it
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals

This work presents the first algorithm for the problem of weighted onlin...
05/05/2018 ∙ by Minjun Chang, et al. ∙ 0 ∙ share

read it
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems

Rapid advances in image acquisition and storage technology underline the...
07/26/2010 ∙ by Barak Fishbain, et al. ∙ 0 ∙ share

read it
Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions

Partitioning and grouping of similar objects plays a fundamental role in...
03/02/2008 ∙ by Dorit S. Hochbaum, et al. ∙ 0 ∙ share

read it