Dorit S. Hochbaum

192 papers A* 6A 2B 9C 5Journal 147Unranked 20
YearRankTypeTitle / Venue / Authors
2026 C conf
A Fast Algorithm for Euclidean Maximum Weight Non-Bipartite Matching.
ICPRAM
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum
2026 J jnl
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm.
CoRR
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum, Jason Yang
2026 — conf
Backbones in Pseudo-Boolean Optimization: Extraction and Analysis.
ICAART (5)
Matías Francia-Carramiñana, Bryan Alvarado-Ulloa, Dorit S. Hochbaum, Bistra Dilkina, Ricardo Ñanculef, Roberto Asín-Achá
2025 J jnl
A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem.
Eur. J. Oper. Res.
Dorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt, Y. Zhang
2025 J jnl
An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints.
INFORMS J. Comput.
Philipp Baumann, Dorit S. Hochbaum
2025 J jnl
An Effective Flow-based Method for Positive-Unlabeled Learning: 2-HNC.
CoRR
Dorit S. Hochbaum, Torpong Nitayanont
2025 J jnl
Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits.
Comput. Oper. Res.
Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá
2025 J jnl
Confidence HNC: A Network Flow Technique for Binary Classification with Noisy Labels.
CoRR
Dorit S. Hochbaum, Torpong Nitayanont
2025 J jnl
Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study.
CoRR
Dorit S. Hochbaum, Ayleen Irribarra-Cortés, Olivier Goldschmidt, Roberto Javier Asín Achá
2025 J jnl
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings.
INFORMS J. Optim.
Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin
2024 J jnl
Binary weights spanning trees and the k-red spanning tree problem in linear time.
CoRR
Dorit S. Hochbaum
2024 — conf
Flow Is Best, Fast and Scalable: The Incremental Parametric Cut for Maximum Density and Other Ratio Subgraph Problems.
KDIR
Dorit S. Hochbaum
2024 C conf
Path of Solutions for Fused Lasso Problems.
ICPRAM
Torpong Nitayanont, Cheng Lu, Dorit S. Hochbaum
2024 — conf
Positive-Unlabeled Learning Using Pairwise Similarity and Parametric Minimum Cuts.
KDIR
Torpong Nitayanont, Dorit S. Hochbaum
2024 J jnl
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques.
Networks
Roberto Javier Asín Achá, Alexis Espinoza, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
2024 — conf
Text-Based Feature-Free Automatic Algorithm Selection.
KDIR
Amanda Salinas-Pinto, Bryan Alvarado-Ulloa, Dorit S. Hochbaum, Matías Francia-Carramiñana, Ricardo Ñanculef, Roberto Javier Asín Achá
2023 — conf
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems.
ACDA
Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt
2023 J jnl
Algorithms and Complexities of Matching Variants in Covariate Balancing.
Oper. Res.
Dorit S. Hochbaum, Asaf Levin, Xu Rao
2023 J jnl
Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits.
CoRR
Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá
2023 J jnl
Obituary for Professor Emeritus Jakob Kraurp.
Eur. J. Oper. Res.
Anita Schöbel, David Pisinger, Dorit S. Hochbaum
2023 J jnl
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings.
CoRR
Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin
2023 — conf
Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging.
KDIR
Dorit S. Hochbaum
2022 J jnl
A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time.
SN Comput. Sci.
Jonathan Bodine, Dorit S. Hochbaum
2022 C conf
A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints.
ICPRAM
Philipp Baumann, Dorit S. Hochbaum
2022 J jnl
A unified approach for a 1D generalized total variation problem.
Math. Program.
Cheng Lu, Dorit S. Hochbaum
2022 — conf
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters.
KDIR
Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
2022 J jnl
Isolation branching: a branch and bound algorithm for the k-terminal cut problem.
J. Comb. Optim.
Mark Velednitsky, Dorit S. Hochbaum
2022 J jnl
Network flow methods for the minimum covariate imbalance problem.
Eur. J. Oper. Res.
Dorit S. Hochbaum, Xu Rao, Jason J. Sauppe
2022 J jnl
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm.
CoRR
Philipp Baumann, Dorit S. Hochbaum
2021 J jnl
Applications and efficient algorithms for integer programming problems on monotone constraints.
Networks
Dorit S. Hochbaum
2021 J jnl
Complexity, algorithms and applications of the integer network flow with fractional supplies problem.
Oper. Res. Lett.
Dorit S. Hochbaum, Asaf Levin, Xu Rao
2021 J jnl
Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition.
CoRR
Dorit S. Hochbaum, Erick Moreno-Centeno
2020 J jnl
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem.
CoRR
Dorit S. Hochbaum, Xu Rao
2020 J jnl
A fully polynomial time approximation scheme for the Replenishment Storage problem.
Oper. Res. Lett.
Dorit S. Hochbaum, Xu Rao
2020 J jnl
Algorithms and Complexity for Variants of Covariates Fine Balance.
CoRR
Dorit S. Hochbaum, Asaf Levin, Xu Rao
2020 J jnl
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Theory Comput. Syst.
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
2020 J jnl
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer.
Inf. Process. Lett.
Dorit S. Hochbaum, Xu Rao
2020 J jnl
Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems.
SIAM J. Optim.
Dorit S. Hochbaum, Cheng Lu
2020 J jnl
HNCcorr: combinatorial optimization for neuron identification.
Ann. Oper. Res.
Roberto Javier Asín Achá, Dorit S. Hochbaum, Quico Spaen
2020 J jnl
Network Flow Methods for the Minimum Covariates Imbalance Problem.
CoRR
Dorit S. Hochbaum, Xu Rao
2020 — conf
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees.
KDIR
Jonathan Bodine, Dorit S. Hochbaum
2020 J jnl
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees.
CoRR
Jonathan Bodine, Dorit S. Hochbaum
2019 J jnl
A comparative study of the leading machine learning techniques and two new optimization algorithms.
Eur. J. Oper. Res.
Philipp Baumann, Dorit S. Hochbaum, Yan T. Yang
2019 J jnl
Algorithms and complexity of range clustering.
Networks
Dorit S. Hochbaum
2019 — conf
Detecting Aberrant Linking Behavior in Directed Networks.
KDIR
Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
2019 J jnl
Efficient algorithms to discover alterations with complementary functional association in cancer.
PLoS Comput. Biol.
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
2019 J jnl
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem.
Oper. Res.
Dorit S. Hochbaum, Xu Rao
2018 J jnl
Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing.
Oper. Res.
Dorit S. Hochbaum, Sheng Liu
2018 J jnl
Algorithms and Complexity of Range Clustering.
CoRR
Dorit S. Hochbaum
2018 J jnl
Complexity and approximations for submodular minimization problems on two variables per inequality constraints.
Discret. Appl. Math.
Dorit S. Hochbaum
2018 J jnl
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals.
CoRR
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
2018 B conf
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
WAOA
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
2018 B conf
Efficient Algorithms to Discover Alterations with Complementary Functional Association in Cancer.
RECOMB
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
2018 C conf
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem.
COCOA
Mark Velednitsky, Dorit S. Hochbaum
2018 J jnl
Weighted matching with pair restrictions.
Optim. Lett.
Dorit S. Hochbaum, Asaf Levin
2017 J jnl
A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems.
SIAM J. Optim.
Dorit S. Hochbaum, Cheng Lu
2017 — conf
High-performance geometric algorithms for sparse computation in big data analytics.
IEEE BigData
Philipp Baumann, Dorit S. Hochbaum, Quico Spaen
2016 J jnl
A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications.
J. Real Time Image Process.
Barak Fishbain, Dorit S. Hochbaum, Stefan Müller
2016 J jnl
A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem.
Comput. Ind. Eng.
Dorit S. Hochbaum
2016 J jnl
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
Dorit S. Hochbaum
2016 J jnl
Sparse Computation for Large-Scale Data Mining.
IEEE Trans. Big Data
Dorit S. Hochbaum, Philipp Baumann
2016 C conf
Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets.
ICPRAM
Philipp Baumann, Dorit S. Hochbaum, Quico Spaen
2015 — conf
Efficient deployment of mobile detectors for security applications.
IEEM
Philipp Baumann, Reynold J. Cooper, Dorit S. Hochbaum, Nidhi Patel, Kunal Shalia
2015 J jnl
Range contracts: Risk sharing and beyond.
Eur. J. Oper. Res.
Dorit S. Hochbaum, Michael R. Wagner
2014 J jnl
Security routing games with multivehicle Chinese postman problem.
Networks
Dorit S. Hochbaum, Cheng Lyu, Fernando Ordóñez
2014 — conf
Sparse computation for large-scale data mining.
IEEE BigData
Dorit S. Hochbaum, Philipp Baumann
2014 J jnl
The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials.
INFORMS J. Comput.
Yan T. Yang, Barak Fishbain, Dorit S. Hochbaum, Eric B. Norman, Erik Swanberg
2013 J jnl
A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant.
Oper. Res.
Dorit S. Hochbaum
2013 J jnl
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems.
ACM Trans. Algorithms
Dorit S. Hochbaum, Asaf Levin
2013 J jnl
Evaluating performance of image segmentation criteria and techniques.
EURO J. Comput. Optim.
Dorit S. Hochbaum, Cheng Lyu, Erik Bertelli
2013 — conf
Real-time robust target tracking in videos via graph-cuts.
Real-Time Image and Video Processing
Barak Fishbain, Dorit S. Hochbaum, Yan T. Yang
2013 J jnl
Simplifications and speedups of the pseudoflow algorithm.
Networks
Dorit S. Hochbaum, James B. Orlin
2012 J jnl
Multiflow Transmission in Delay Constrained Cooperative Wireless Networks
CoRR
Marjan A. Baghaie, Dorit S. Hochbaum, Bhaskar Krishnamachari
2012 J jnl
Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores.
Bioinform.
Dorit S. Hochbaum, Chun-Nan Hsu, Yan T. Yang
2011 — conf
An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization.
SSVM
Dorit S. Hochbaum
2011 J jnl
Benchmark Problems for Totally Unimodular Set System Auction
CoRR
Ilan Adler, Dorit S. Hochbaum
2011 J jnl
Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images.
Algorithmic Oper. Res.
Joe Qranfal, Dorit S. Hochbaum, Germain Tanoh
2011 J jnl
Nuclear threat detection with mobile distributed sensor networks.
Ann. Oper. Res.
Dorit S. Hochbaum, Barak Fishbain
2011 B conf
On Hardness of Multiflow Transmission in Delay Constrained Cooperative Wireless Networks.
GLOBECOM
Marjan A. Baghaie, Dorit S. Hochbaum, Bhaskar Krishnamachari
2011 J jnl
Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm
CoRR
Bala G. Chandran, Dorit S. Hochbaum
2011 J jnl
Rating Customers According to Their Promptness to Adopt New Products.
Oper. Res.
Dorit S. Hochbaum, Erick Moreno-Centeno, Phillip Yelland, Rodolfo A. Catena
2010 J jnl
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
CoRR
Barak Fishbain, Dorit S. Hochbaum, Stefan Müller
2010 J jnl
Complexity of some inverse shortest path lengths problems.
Networks
Tingting Cui, Dorit S. Hochbaum
2010 J jnl
Covering the edges of bipartite graphs using K
Theor. Comput. Sci.
Dorit S. Hochbaum, Asaf Levin
2010 J jnl
How to allocate review tasks for robust ranking.
Acta Informatica
Dorit S. Hochbaum, Asaf Levin
2010 J jnl
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut.
IEEE Trans. Pattern Anal. Mach. Intell.
Dorit S. Hochbaum
2010 J jnl
Submodular problems - approximations and algorithms
CoRR
Dorit S. Hochbaum
2009 J jnl
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem.
Oper. Res.
Bala G. Chandran, Dorit S. Hochbaum
2009 — conf
An Efficient and Effective Image Segmentation Interactive Tool.
BIOSIGNALS
Dorit S. Hochbaum
2009 A* conf
An efficient algorithm for Co-segmentation.
ICCV
Dorit S. Hochbaum, Vikas Singh
2009 J jnl
Dynamic evolution of economically preferred facilities.
Eur. J. Oper. Res.
Dorit S. Hochbaum
2009 J jnl
The multi-integer set cover and the facility terminal cover problem.
Networks
Dorit S. Hochbaum, Asaf Levin
2008 J jnl
Country credit-risk rating aggregation via the separation-deviation model.
Optim. Methods Softw.
Dorit S. Hochbaum, Erick Moreno-Centeno
2008 J jnl
Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
CoRR
Dorit S. Hochbaum
2008 J jnl
Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in
Oper. Res.
Ravindra K. Ahuja, Dorit S. Hochbaum
2008 J jnl
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem.
Oper. Res.
Dorit S. Hochbaum
2008 J jnl
The inequality-satisfiability problem.
Oper. Res. Lett.
Dorit S. Hochbaum, Erick Moreno-Centeno
2007 J jnl
Complexity and algorithms for nonlinear optimization problems.
Ann. Oper. Res.
Dorit S. Hochbaum
2007 B conf
Covering the Edges of Bipartite Graphs Using
WAOA
Dorit S. Hochbaum, Asaf Levin
2006 J jnl
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms.
Discret. Optim.
Dorit S. Hochbaum, Asaf Levin
2006 J jnl
Methodologies and Algorithms for Group-Rankings Decision.
Manag. Sci.
Dorit S. Hochbaum, Asaf Levin
2006 J jnl
Optimizing over Consecutive 1's and Circular 1's Constraints.
SIAM J. Optim.
Dorit S. Hochbaum, Asaf Levin
2006 — conf
Ranking Sports Teams and the Inverse Equal Paths Problem.
WINE
Dorit S. Hochbaum
2006 B conf
The
WAOA
Dorit S. Hochbaum, Asaf Levin
2005 J jnl
Complexity and algorithms for convex network optimization and other nonlinear problems.
4OR
Dorit S. Hochbaum
2004 J jnl
50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today.
Manag. Sci.
Dorit S. Hochbaum
2004 J jnl
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
2004 — ch.
Due Date Quotation Models and Algorithms.
Handbook of Scheduling
Philip M. Kaminsky, Dorit S. Hochbaum
2004 J jnl
Monotonizing linear programs with up to two nonzeroes per column.
Oper. Res. Lett.
Dorit S. Hochbaum
2003 J jnl
Efficient Algorithms for the Inverse Spanning-Tree Problem.
Oper. Res.
Dorit S. Hochbaum
2003 J jnl
Minimizing a Convex Cost Closure Set.
SIAM J. Discret. Math.
Dorit S. Hochbaum, Maurice Queyranne
2003 J jnl
Solving the Convex Cost Integer Dual Network Flow Problem.
Manag. Sci.
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
2003 J jnl
The SONET edge-partition problem.
Networks
Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
2002 J jnl
Baseball, Optimization, and the World Wide Web.
Interfaces
Ilan Adler, Alan L. Erera, Dorit S. Hochbaum, Eli V. Olinick
2002 J jnl
Minimax problems with bitonic matrices.
Networks
Dorit S. Hochbaum, Paul A. Tucker
2002 J jnl
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations.
Eur. J. Oper. Res.
Dorit S. Hochbaum
2001 J jnl
A new - old algorithm for minimum-cut and maximum-flow in closure graphs.
Networks
Dorit S. Hochbaum
2001 J jnl
An efficient algorithm for image segmentation, Markov random fields and related problems.
J. ACM
Dorit S. Hochbaum
2001 J jnl
Capacity Acquisition, Subcontracting, and Lot Sizing.
Manag. Sci.
Alper Atamtürk, Dorit S. Hochbaum
2001 J jnl
The Bounded Cycle-Cover Problem.
INFORMS J. Comput.
Dorit S. Hochbaum, Eli V. Olinick
2000 J jnl
Approximating a generalization of MAX 2SAT and MIN 2SAT.
Discret. Appl. Math.
Dorit S. Hochbaum, Anu Pathria
2000 — conf
Instant recognition of polynominal time solvability, half integrality and 2-approximations.
APPROX
Dorit S. Hochbaum
2000 A conf
Minimizing a Convex Cost Closure Set.
ESA
Dorit S. Hochbaum, Maurice Queyranne
2000 J jnl
Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem.
Oper. Res.
Dorit S. Hochbaum, Anna Chen
1999 J jnl
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine.
Oper. Res. Lett.
Fabián A. Chudak, Dorit S. Hochbaum
1999 J jnl
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources.
Oper. Res. Lett.
Dorit S. Hochbaum, Gerhard J. Woeginger
1999 — ed.
Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings
RANDOM-APPROX
Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair
1999 B conf
Solving the Convex Cost Integer Dual Network Flow Problem.
IPCO
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
1998 J jnl
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs.
Oper. Res. Lett.
Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson
1998 J jnl
Approximating Clique and Biclique Problems.
J. Algorithms
Dorit S. Hochbaum
1998 — ed.
Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
APPROX
Klaus Jansen, Dorit S. Hochbaum
1998 — conf
Instant Recognition of Half Integrality and 2-Approximations.
APPROX
Dorit S. Hochbaum
1998 — conf
The
APPROX
Dorit S. Hochbaum
1998 B conf
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem.
IPCO
Dorit S. Hochbaum
1997 J jnl
A New and Fast Approach to Very Large Scale Integrated Sequential Circuit Test Generation.
Oper. Res.
J. B. Adams, Dorit S. Hochbaum
1997 J jnl
An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane.
Algorithmica
Naveen Garg, Dorit S. Hochbaum
1997 J jnl
Approximation Algorithms for NP-Hard Problems.
SIGACT News
Dorit S. Hochbaum
1997 J jnl
Generalized p-Center problems: Complexity results and approximation algorithms.
Eur. J. Oper. Res.
Dorit S. Hochbaum, Anu Pathria
1997 J jnl
Path Costs in Evolutionary Tree Reconstruction.
J. Comput. Biol.
Dorit S. Hochbaum, Anu Pathria
1997 J jnl
Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime.
Oper. Res.
Dorit S. Hochbaum, Dan Landy
1997 J jnl
Scheduling with Batching: Two Job Types.
Discret. Appl. Math.
Dorit S. Hochbaum, Dan Landy
1997 J jnl
k-edge Subgraph Problems.
Discret. Appl. Math.
Olivier Goldschmidt, Dorit S. Hochbaum
1996 J jnl
An optimal test compression procedure for combinational circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Dorit S. Hochbaum
1996 J jnl
Approximation Algorithms for Network Design Problems on Bounded Subsets.
J. Algorithms
Dorit S. Hochbaum, Joseph Naor
1996 J jnl
Approximation Algorithms for the
SIAM J. Discret. Math.
Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
1996 J jnl
On the Complexity of the Production-Transportation Problem.
SIAM J. Optim.
Dorit S. Hochbaum, Sung-Pil Hong
1996 J jnl
The bottleneck graph partition problem.
Networks
Dorit S. Hochbaum, Anu Pathria
1995 J jnl
A nonlinear Knapsack problem.
Oper. Res. Lett.
Dorit S. Hochbaum
1995 J jnl
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.
Math. Program.
Dorit S. Hochbaum, Sung-Pil Hong
1994 J jnl
A Polynomial Algorithm for the k-cut Problem for Fixed k.
Math. Oper. Res.
Olivier Goldschmidt, Dorit S. Hochbaum
1994 A* conf
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane.
STOC
Naveen Garg, Dorit S. Hochbaum
1994 J jnl
Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems.
Math. Oper. Res.
Dorit S. Hochbaum
1994 J jnl
Scheduling with batching: minimizing the weighted number of tardy jobs.
Oper. Res. Lett.
Dorit S. Hochbaum, Dan Landy
1994 J jnl
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality.
SIAM J. Comput.
Dorit S. Hochbaum, Joseph Naor
1994 J jnl
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources.
Math. Oper. Res.
Steven Cosares, Dorit S. Hochbaum
1993 J jnl
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.
Inf. Process. Lett.
Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu
1993 J jnl
The empirical performance of a polynomial algorithm for constrained nonlinear optimization.
Ann. Oper. Res.
Dorit S. Hochbaum, Sridhar Seshadri
1993 J jnl
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.
Math. Program.
Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
1993 J jnl
Why Should Biconnected Components be Identified First.
Discret. Appl. Math.
Dorit S. Hochbaum
1992 J jnl
A polynomial algorithm for an integer quadratic non-separable transportation problem.
Math. Program.
Dorit S. Hochbaum, Ron Shamir, J. George Shanthikumar
1992 J jnl
An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs.
Oper. Res.
Dorit S. Hochbaum
1992 B conf
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality.
IPCO
Dorit S. Hochbaum, Joseph Naor
1991 J jnl
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem.
Oper. Res.
Dorit S. Hochbaum, Ron Shamir
1990 J jnl
A Fast Perfect-Matching Algorithm in Random Graphs.
SIAM J. Discret. Math.
Olivier Goldschmidt, Dorit S. Hochbaum
1990 J jnl
Asymptotically Optimal Linear Algorithm for the Minimum
SIAM J. Discret. Math.
Olivier Goldschmidt, Dorit S. Hochbaum
1990 J jnl
Convex Separable Optimization Is Not Much Harder than Linear Optimization
J. ACM
Dorit S. Hochbaum, J. George Shanthikumar
1990 J jnl
Minimizing the number of tardy job units under release time constraints.
Discret. Appl. Math.
Dorit S. Hochbaum, Ron Shamir
1990 B conf
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions.
IPCO
Dorit S. Hochbaum
1989 J jnl
An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem.
Inf. Process. Lett.
Dorit S. Hochbaum, Ron Shamir
1989 J jnl
Analysis of a flow problem with fixed charges.
Networks
Dorit S. Hochbaum, Arie Segev
1989 A* conf
The Complexity of Nonlinear Separable Optimization.
ICALP
Dorit S. Hochbaum, J. George Shanthikumar
1988 J jnl
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach.
SIAM J. Comput.
Dorit S. Hochbaum, David B. Shmoys
1988 A* conf
Polynomial Algorithm for the k-Cut Problem
FOCS
Olivier Goldschmidt, Dorit S. Hochbaum
1987 J jnl
Fast Approximation Algorithms for a Nonconvex Covering Problem.
J. Algorithms
Dorit S. Hochbaum, Wolfgang Maass
1987 J jnl
Using dual approximation algorithms for scheduling problems theoretical and practical results.
J. ACM
Dorit S. Hochbaum, David B. Shmoys
1986 J jnl
A Better than "Best Possible" Algorithm to Edge Color Multigraphs.
J. Algorithms
Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys
1986 — conf
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach.
FSTTCS
Dorit S. Hochbaum, David B. Shmoys
1986 J jnl
A fast approximation algorithm for the multicovering problem.
Discret. Appl. Math.
Nicholas G. Hall, Dorit S. Hochbaum
1986 J jnl
A unified approach to approximation algorithms for bottleneck problems.
J. ACM
Dorit S. Hochbaum, David B. Shmoys
1986 J jnl
OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing.
Oper. Res.
Thomas A. Feo, Dorit S. Hochbaum
1986 J jnl
The Linzertorte problem, or a unified approach to painting, baking and weaving.
Discret. Appl. Math.
Dorit S. Hochbaum, Edna Wigderson
1985 J jnl
A Best Possible Heuristic for the
Math. Oper. Res.
Dorit S. Hochbaum, David B. Shmoys
1985 J jnl
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI
J. ACM
Dorit S. Hochbaum, Wolfgang Maass
1985 A* conf
Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results
FOCS
Dorit S. Hochbaum, David B. Shmoys
1984 A conf
Approximation Schemes for Covering and Packing Problems in Robotics and VLSI.
STACS
Dorit S. Hochbaum, Wolfgang Maass
1984 A* conf
Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems
STOC
Dorit S. Hochbaum, David B. Shmoys
1984 J jnl
When are NP-hard location problems easy?
Ann. Oper. Res.
Dorit S. Hochbaum
1983 J jnl
Efficient bounds for the stable set, vertex cover and set packing problems.
Discret. Appl. Math.
Dorit S. Hochbaum
1982 J jnl
Approximation Algorithms for the Set Covering and Vertex Cover Problems.
SIAM J. Comput.
Dorit S. Hochbaum
1982 J jnl
Heuristics for the fixed cost median problem.
Math. Program.
Dorit S. Hochbaum
1980 J jnl
Database Location in Computer Networks.
J. ACM
Marshall L. Fisher, Dorit S. Hochbaum
1980 J jnl
Probabilistic Analysis of the Planar
Math. Oper. Res.
Marshall L. Fisher, Dorit S. Hochbaum