Dorit S. Hochbaum

ORCID

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 48

Top Venues

Publications

Torpong Nitayanont, Cheng Lu, Dorit S. Hochbaum
Path of Solutions for Fused Lasso Problems. ICPRAM (2024)
Dorit S. Hochbaum
Binary weights spanning trees and the k-red spanning tree problem in linear time. CoRR (2024)
Dorit S. Hochbaum, Asaf Levin, Xu Rao
Algorithms and Complexities of Matching Variants in Covariate Balancing. Oper. Res. 71 (5) (2023)
Anita Schöbel, David Pisinger, Dorit S. Hochbaum
Obituary for Professor Emeritus Jakob Kraurp. Eur. J. Oper. Res. 310 (1) (2023)
Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. CoRR (2023)
Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. ACDA (2023)
Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá
Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits. CoRR (2023)
Dorit S. Hochbaum
Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. KDIR (2023)
Cheng Lu, Dorit S. Hochbaum
A unified approach for a 1D generalized total variation problem. Math. Program. 194 (1) (2022)
Mark Velednitsky, Dorit S. Hochbaum
Isolation branching: a branch and bound algorithm for the k-terminal cut problem. J. Comb. Optim. 44 (3) (2022)
Philipp Baumann, Dorit S. Hochbaum
A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. ICPRAM (2022)
Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. KDIR (2022)
Philipp Baumann, Dorit S. Hochbaum
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. CoRR (2022)
Dorit S. Hochbaum, Xu Rao, Jason J. Sauppe
Network flow methods for the minimum covariate imbalance problem. Eur. J. Oper. Res. 300 (3) (2022)
Jonathan Bodine, Dorit S. Hochbaum
A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time. SN Comput. Sci. 3 (4) (2022)
Dorit S. Hochbaum, Erick Moreno-Centeno
Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition. CoRR (2021)
Dorit S. Hochbaum
Applications and efficient algorithms for integer programming problems on monotone constraints. Networks 77 (1) (2021)
Dorit S. Hochbaum, Asaf Levin, Xu Rao
Complexity, algorithms and applications of the integer network flow with fractional supplies problem. Oper. Res. Lett. 49 (4) (2021)
Dorit S. Hochbaum, Cheng Lu
Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems. SIAM J. Optim. 30 (1) (2020)
Jonathan Bodine, Dorit S. Hochbaum
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees. CoRR (2020)
Dorit S. Hochbaum, Xu Rao
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem. CoRR (2020)
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Theory Comput. Syst. 64 (4) (2020)
Dorit S. Hochbaum, Xu Rao
A fully polynomial time approximation scheme for the Replenishment Storage problem. Oper. Res. Lett. 48 (6) (2020)
Dorit S. Hochbaum, Xu Rao
Network Flow Methods for the Minimum Covariates Imbalance Problem. CoRR (2020)
Roberto Javier Asín Achá, Dorit S. Hochbaum, Quico Spaen
HNCcorr: combinatorial optimization for neuron identification. Ann. Oper. Res. 289 (1) (2020)
Dorit S. Hochbaum, Xu Rao
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer. Inf. Process. Lett. 158 (2020)
Dorit S. Hochbaum, Asaf Levin, Xu Rao
Algorithms and Complexity for Variants of Covariates Fine Balance. CoRR (2020)
Jonathan Bodine, Dorit S. Hochbaum
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees. KDIR (2020)
Dorit S. Hochbaum, Xu Rao
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem. Oper. Res. 67 (5) (2019)
Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
Detecting Aberrant Linking Behavior in Directed Networks. KDIR (2019)
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
Efficient algorithms to discover alterations with complementary functional association in cancer. PLoS Comput. Biol. 15 (5) (2019)
Dorit S. Hochbaum
Algorithms and complexity of range clustering. Networks 73 (2) (2019)
Philipp Baumann, Dorit S. Hochbaum, Yan T. Yang
A comparative study of the leading machine learning techniques and two new optimization algorithms. Eur. J. Oper. Res. 272 (3) (2019)
Dorit S. Hochbaum, Sheng Liu
Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing. Oper. Res. 66 (6) (2018)
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. CoRR (2018)
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. WAOA (2018)
Mark Velednitsky, Dorit S. Hochbaum
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. COCOA (2018)
Dorit S. Hochbaum, Asaf Levin
Weighted matching with pair restrictions. Optim. Lett. 12 (3) (2018)
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
Efficient Algorithms to Discover Alterations with Complementary Functional Association in Cancer. RECOMB (2018)
Dorit S. Hochbaum
Algorithms and Complexity of Range Clustering. CoRR (2018)
Dorit S. Hochbaum
Complexity and approximations for submodular minimization problems on two variables per inequality constraints. Discret. Appl. Math. 250 (2018)
Philipp Baumann, Dorit S. Hochbaum, Quico Spaen
High-performance geometric algorithms for sparse computation in big data analytics. IEEE BigData (2017)
Dorit S. Hochbaum, Cheng Lu
A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems. SIAM J. Optim. 27 (4) (2017)
Dorit S. Hochbaum, Philipp Baumann
Sparse Computation for Large-Scale Data Mining. IEEE Trans. Big Data 2 (2) (2016)
Dorit S. Hochbaum
Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm. CoRR (2016)
Philipp Baumann, Dorit S. Hochbaum, Quico Spaen
Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. ICPRAM (2016)
Dorit S. Hochbaum
A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem. Comput. Ind. Eng. 95 (2016)
Barak Fishbain, Dorit S. Hochbaum, Stefan Müller
A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications. J. Real Time Image Process. 11 (3) (2016)
Dorit S. Hochbaum, Michael R. Wagner
Range contracts: Risk sharing and beyond. Eur. J. Oper. Res. 243 (3) (2015)
Philipp Baumann, Reynold J. Cooper, Dorit S. Hochbaum, Nidhi Patel, Kunal Shalia
Efficient deployment of mobile detectors for security applications. IEEM (2015)
Yan T. Yang, Barak Fishbain, Dorit S. Hochbaum, Eric B. Norman, Erik Swanberg
The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials. INFORMS J. Comput. 26 (1) (2014)
Dorit S. Hochbaum, Cheng Lyu, Fernando Ordóñez
Security routing games with multivehicle Chinese postman problem. Networks 64 (3) (2014)
Dorit S. Hochbaum, Philipp Baumann
Sparse computation for large-scale data mining. IEEE BigData (2014)
Dorit S. Hochbaum, Cheng Lyu, Erik Bertelli
Evaluating performance of image segmentation criteria and techniques. EURO J. Comput. Optim. 1 (1-2) (2013)
Dorit S. Hochbaum
A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant. Oper. Res. 61 (1) (2013)
Barak Fishbain, Dorit S. Hochbaum, Yan T. Yang
Real-time robust target tracking in videos via graph-cuts. Real-Time Image and Video Processing (2013)
Dorit S. Hochbaum, Asaf Levin
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. ACM Trans. Algorithms 9 (2) (2013)
Dorit S. Hochbaum, James B. Orlin
Simplifications and speedups of the pseudoflow algorithm. Networks 61 (1) (2013)
Dorit S. Hochbaum, Chun-Nan Hsu, Yan T. Yang
Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores. Bioinform. 28 (12) (2012)
Marjan A. Baghaie, Dorit S. Hochbaum, Bhaskar Krishnamachari
Multiflow Transmission in Delay Constrained Cooperative Wireless Networks CoRR (2012)
Marjan A. Baghaie, Dorit S. Hochbaum, Bhaskar Krishnamachari
On Hardness of Multiflow Transmission in Delay Constrained Cooperative Wireless Networks. GLOBECOM (2011)
Dorit S. Hochbaum, Barak Fishbain
Nuclear threat detection with mobile distributed sensor networks. Ann. Oper. Res. 187 (1) (2011)
Ilan Adler, Dorit S. Hochbaum
Benchmark Problems for Totally Unimodular Set System Auction CoRR (2011)
Dorit S. Hochbaum, Erick Moreno-Centeno, Phillip Yelland, Rodolfo A. Catena
Rating Customers According to Their Promptness to Adopt New Products. Oper. Res. 59 (5) (2011)
Joe Qranfal, Dorit S. Hochbaum, Germain Tanoh
Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images. Algorithmic Oper. Res. 6 (2) (2011)
Dorit S. Hochbaum
An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization. SSVM (2011)
Bala G. Chandran, Dorit S. Hochbaum
Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm CoRR (2011)
Dorit S. Hochbaum
Submodular problems - approximations and algorithms CoRR (2010)
Tingting Cui, Dorit S. Hochbaum
Complexity of some inverse shortest path lengths problems. Networks 56 (1) (2010)
Dorit S. Hochbaum
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut. IEEE Trans. Pattern Anal. Mach. Intell. 32 (5) (2010)
Dorit S. Hochbaum, Asaf Levin
graphs. Theor. Comput. Sci. 411 (1) (2010)
Dorit S. Hochbaum, Asaf Levin
How to allocate review tasks for robust ranking. Acta Informatica 47 (5-6) (2010)
Barak Fishbain, Dorit S. Hochbaum, Stefan Müller
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems CoRR (2010)
Dorit S. Hochbaum, Asaf Levin
The multi-integer set cover and the facility terminal cover problem. Networks 53 (1) (2009)
Bala G. Chandran, Dorit S. Hochbaum
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem. Oper. Res. 57 (2) (2009)
Dorit S. Hochbaum
An Efficient and Effective Image Segmentation Interactive Tool. BIOSIGNALS (2009)
Dorit S. Hochbaum, Vikas Singh
An efficient algorithm for Co-segmentation. ICCV (2009)
Dorit S. Hochbaum
Dynamic evolution of economically preferred facilities. Eur. J. Oper. Res. 193 (3) (2009)
Dorit S. Hochbaum
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem. Oper. Res. 56 (4) (2008)
Dorit S. Hochbaum
Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions CoRR (2008)
Dorit S. Hochbaum, Erick Moreno-Centeno
The inequality-satisfiability problem. Oper. Res. Lett. 36 (2) (2008)
Dorit S. Hochbaum, Erick Moreno-Centeno
Country credit-risk rating aggregation via the separation-deviation model. Optim. Methods Softw. 23 (5) (2008)
Ravindra K. Ahuja, Dorit S. Hochbaum
) Time. Oper. Res. 56 (1) (2008)
Dorit S. Hochbaum
Complexity and algorithms for nonlinear optimization problems. Ann. Oper. Res. 153 (1) (2007)
Dorit S. Hochbaum, Asaf Levin
Graphs. WAOA (2007)
Dorit S. Hochbaum, Asaf Levin
-Allocation Problem and Its Variants. WAOA (2006)
Dorit S. Hochbaum, Asaf Levin
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discret. Optim. 3 (4) (2006)
Dorit S. Hochbaum
Ranking Sports Teams and the Inverse Equal Paths Problem. WINE (2006)
Dorit S. Hochbaum, Asaf Levin
Methodologies and Algorithms for Group-Rankings Decision. Manag. Sci. 52 (9) (2006)
Dorit S. Hochbaum, Asaf Levin
Optimizing over Consecutive 1's and Circular 1's Constraints. SIAM J. Optim. 17 (2) (2006)
Dorit S. Hochbaum
Complexity and algorithms for convex network optimization and other nonlinear problems. 4OR 3 (3) (2005)
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. Algorithmica 39 (3) (2004)
Dorit S. Hochbaum
50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today. Manag. Sci. 50 (6) (2004)
Dorit S. Hochbaum
Monotonizing linear programs with up to two nonzeroes per column. Oper. Res. Lett. 32 (1) (2004)
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
Solving the Convex Cost Integer Dual Network Flow Problem. Manag. Sci. 49 (7) (2003)
Dorit S. Hochbaum, Maurice Queyranne
Minimizing a Convex Cost Closure Set. SIAM J. Discret. Math. 16 (2) (2003)
Dorit S. Hochbaum
Efficient Algorithms for the Inverse Spanning-Tree Problem. Oper. Res. 51 (5) (2003)
Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
The SONET edge-partition problem. Networks 41 (1) (2003)
Ilan Adler, Alan L. Erera, Dorit S. Hochbaum, Eli V. Olinick
Baseball, Optimization, and the World Wide Web. Interfaces 32 (2) (2002)
Dorit S. Hochbaum, Paul A. Tucker
Minimax problems with bitonic matrices. Networks 40 (3) (2002)

Dorit S. Hochbaum.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dorit S. Hochbaum