D. Hochbaum

发表

An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem

D. Hochbaum, D. Shmoys, 1985 .

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochbaum, D. Hochbaum, 1996 .

Steinhaus's geometric location problem for random samples in the plane

J. Steele, D. Hochbaum, 1982, Advances in Applied Probability.

Approximating Clique and Biclique Problems

Dorit S. Hochbaum, D. Hochbaum, 1998, J. Algorithms.

Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems

D. Hochbaum, 1996 .

Analysis of the greedy approach in problems of maximum k‐coverage

D. Hochbaum, A. Pathria, 1998 .

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

David P. Williamson, Fabián A. Chudak, Michel X. Goemans, 1998, Oper. Res. Lett..

A best possible approximation algorithm for the k--center problem

D. Hochbaum, D. Shmoys, 1985 .

OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing

Dorit S. Hochbaum, Thomas A. Feo, D. Hochbaum, 1986, Oper. Res..

Minimax problems with bitonic matrices

Dorit S. Hochbaum, Paul A. Tucker, P. Tucker, 2002, Networks.

Multi-Label Markov Random Fields as an Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization

D. Hochbaum, 2013 .

The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem

Dorit S. Hochbaum, D. Hochbaum, 1998, IPCO.

An algorithm for the detection and construction of Monge sequences

N. Alon, R. Shamir, D. Hochbaum, 1989 .

On the partitioning of graphs and hypergraphs

I. Adler, D. Hochbaum, Mallek Khellaf, 1987 .

A Best Possible Heuristic for the k-Center Problem

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1985, Math. Oper. Res..

Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs

D. Hochbaum, 1985 .

The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Dorit S. Hochbaum, D. Hochbaum, 2008, Oper. Res..

The multi-integer set cover and the facility terminal cover problem

D. Hochbaum, Asaf Levin, 2009 .

Forest Harvesting and Minimum Cuts: A New Approach to Handling Spatial Constraints

D. Hochbaum, A. Pathria, 1997 .

To appear in : Approximation Algorithms

D. Hochbaum, D. Hochbaum, 2007 .

Networking over Next-generation Satellite Systems Committee in Charge: Networking over Next-generation Satellite Systems Abstract Networking over Next-generation Satellite Systems Contents

R. Katz, D. Hochbaum, S. McCanne, 1999 .

The Separation , and Separation-Deviation Methodology

D. Hochbaum, 2010 .

IEOR 269, Spring 2010 Integer Programming and Combinatorial Optimization

D. Hochbaum, 2010 .

Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer

Mark D. M. Leiserson, R. Sharan, D. Hochbaum, 2020, Genome Medicine.

0 a Generic R-approximation Algorithm

D. Geiger, F Chudak, M. Goemans, 2022 .

On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions

Dorit S. Hochbaum, D. Hochbaum, 1990, Conference on Integer Programming and Combinatorial Optimization.

Aprimal{dualinterpretationoftwo2-approximationalgorithms forthefeedbackvertexsetprobleminundirectedgraphs

David P. Williamson, Fabián A. Chudak, M. Goemans, 1998 .

Approximation Algorithms for NP-Hard Problems

D. Hochbaum, 1996 .

HNCcorr: combinatorial optimization for neuron identification

D. Hochbaum, Quico Spaen, Roberto Asín Achá, 2019, Annals of Operations Research.

Weighted matching with pair restrictions

D. Hochbaum, Asaf Levin, 2017, Optimization Letters.

Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters

Roberto Javier Asín Achá, Isaías I. Huerta, D. Hochbaum, 2022, KDIR.

Using dual approximation algorithms for scheduling problems: practical and theoretical results

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1987 .

Generalized p-Center problems: Complexity results and approximation algorithms

Dorit S. Hochbaum, Anu Pathria, D. Hochbaum, 1997, Eur. J. Oper. Res..

Powers of graphs: A powerful approximation technique for bottleneck problems

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1984, STOC '84.

A unified approach to approximation algorithms for bottleneck problems

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1986, JACM.

PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm

D. Hochbaum, P. Baumann, 2022, ArXiv.

Complexity and algorithms for nonlinear optimization problems

Dorit S. Hochbaum, D. Hochbaum, 2007, Ann. Oper. Res..

Convex separable optimization is not much harder than linear optimization

J. George Shanthikumar, Dorit S. Hochbaum, J. Shanthikumar, 1990, JACM.

A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound

Gang Yu, Dorit S. Hochbaum, Olivier Goldschmidt, 1993, Inf. Process. Lett..

Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer

Roded Sharan, Dorit S. Hochbaum, Teresa M. Przytycka, 2019, Genome Medicine.

Efficient algorithms to discover alterations with complementary functional association in cancer

Dorit S. Hochbaum, Fabio Vandin, Rebecca Sarto Basso, 2018, RECOMB.

Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores

Dorit S. Hochbaum, Chun-Nan Hsu, Yan T. Yang, 2012, Bioinform..

Using dual approximation algorithms for scheduling problems: Theoretical and practical results

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Methodologies and Algorithms for Group-Rankings Decision

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2006, Manag. Sci..

A unified approach for a 1D generalized total variation problem

Dorit S. Hochbaum, Cheng Lu, D. Hochbaum, 2021, Mathematical Programming.

Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images

Dorit S. Hochbaum, Joe Qranfal, Germain Tanoh, 2011, Algorithmic Oper. Res..

Evaluating performance of image segmentation criteria and techniques

Dorit S. Hochbaum, Cheng Lyu, Erik Bertelli, 2013, EURO J. Comput. Optim..

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant

Dorit S. Hochbaum, D. Hochbaum, 2013, Oper. Res..

An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization

Dorit S. Hochbaum, D. Hochbaum, 2011, SSVM.

Lecture Notes for IEOR 266 : Graph Algorithms and Network Flows Professor

Dorit S. Hochbaum, D. Hochbaum, 2011 .

An efficient algorithm for image segmentation, Markov random fields and related problems

Dorit S. Hochbaum, D. Hochbaum, 2001, JACM.

Solving the Convex Cost Integer Dual Network Flow Problem

Dorit S. Hochbaum, Ravindra K. Ahuja, James B. Orlin, 1999, Manag. Sci..

The multicovering problem

Dorit S. Hochbaum, Nicholas G. Hall, D. Hochbaum, 1992 .

Monotonizing linear programs with up to two nonzeroes per column

Dorit S. Hochbaum, D. Hochbaum, 2004, Oper. Res. Lett..

A Polynomial Algorithm for the k-cut Problem for Fixed k

Dorit S. Hochbaum, Olivier Goldschmidt, D. Hochbaum, 1994, Math. Oper. Res..

Efficient bounds for the stable set, vertex cover and set packing problems

Dorit S. Hochbaum, D. Hochbaum, 1983, Discret. Appl. Math..

HNCcorr: A Novel Combinatorial Approach for Cell Identification in Calcium-Imaging Movies

Quico Spaen, Selmaan N. Chettih, Christopher Harvey, 2017, eNeuro.

Approximation Algorithms for the Set Covering and Vertex Cover Problems

Dorit S. Hochbaum, D. Hochbaum, 1982, SIAM J. Comput..

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

Dorit S. Hochbaum, Erick Moreno-Centeno, D. Hochbaum, 2021, ArXiv.

The separation, and separation-deviation methodology for group decision making and aggregate Ranking

Dorit S. Hochbaum, D. Hochbaum, 2010 .

Country credit-risk rating aggregation via the separation-deviation model

Dorit S. Hochbaum, Erick Moreno-Centeno, D. Hochbaum, 2008, Optim. Methods Softw..

Ranking Sports Teams and the Inverse Equal Paths Problem

Dorit S. Hochbaum, D. Hochbaum, 2006, WINE.

Due Date Quotation Models and Algorithms

Dorit S. Hochbaum, Philip Kaminsky, Philip M. Kaminsky, 2004, Handbook of Scheduling.

Identifying Drug Sensitivity Subnetworks with NETPHIX

Dorit S. Hochbaum, Yoo-Ah Kim, Fabio Vandin, 2019, bioRxiv.

Efficient Algorithms for the Inverse Spanning-Tree Problem

Dorit S. Hochbaum, D. Hochbaum, 2003, Oper. Res..

A Graph-Theoretic Approach for Spatial Filtering and Its Impact on Mixed-Type Spatial Pattern Recognition in Wafer Bin Maps

Sheng Liu, Dorit S. Hochbaum, Ahmed Aziz Ezzat, 2020, IEEE Transactions on Semiconductor Manufacturing.

Fast Approximation Algorithms for a Nonconvex Covering Problem

Wolfgang Maass, Dorit S. Hochbaum, W. Maass, 1987, J. Algorithms.

Approximation schemes for covering and packing problems in image processing and VLSI

Wolfgang Maass, Dorit S. Hochbaum, W. Maass, 1985, JACM.

Approximation Schemes for Covering and Packing Problems in Robotics and VLSI

Wolfgang Maass, Dorit S. Hochbaum, W. Maass, 1984, STACS.

A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1988, SIAM J. Comput..

Various notions of approximations: good, better, best, and more

Dorit S. Hochbaum, D. Hochbaum, 1996 .

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Joseph Naor, Nimrod Megiddo, Dorit S. Hochbaum, 1993, Math. Program..

Polynomial algorithm for the k-cut problem

Dorit S. Hochbaum, Olivier Goldschmidt, D. Hochbaum, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

A fast approximation algorithm for the multicovering problem

Dorit S. Hochbaum, Nicholas G. Hall, D. Hochbaum, 1986, Discret. Appl. Math..

Heuristics for the fixed cost median problem

Dorit S. Hochbaum, D. Hochbaum, 1982, Math. Program..

A comparative study of the leading machine learning techniques and two new optimization algorithms

Dorit S. Hochbaum, Philipp Baumann, Yan T. Yang, 2019, Eur. J. Oper. Res..

Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time

Dorit S. Hochbaum, Ravindra K. Ahuja, D. Hochbaum, 2008, Oper. Res..

Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems

Dorit S. Hochbaum, D. Hochbaum, 1994, Math. Oper. Res..

About strongly polynomial time algorithms for quadratic optimization over submodular constraints

Dorit S. Hochbaum, Sung-Pil Hong, D. Hochbaum, 1995, Math. Program..

Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources

Dorit S. Hochbaum, Steven Cosares, D. Hochbaum, 1994, Math. Oper. Res..

Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2013, TALG.

The multi‐integer set cover and the facility terminal cover problem

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2009, Networks.

Scheduling with batching: minimizing the weighted number of tardy jobs

Dorit S. Hochbaum, Dan Landy, D. Hochbaum, 1994, Oper. Res. Lett..

Capacity Acquisition, Subcontracting, and Lot Sizing

Alper Atamtürk, Dorit S. Hochbaum, D. Hochbaum, 2001, Manag. Sci..

Analysis of a flow problem with fixed charges

Arie Segev, Dorit S. Hochbaum, D. Hochbaum, 1989, Networks.

Production cost functions and demand uncertainty effects in price-only contracts

Michael R. Wagner, D. Hochbaum, 2015 .

The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints

Dorit S. Hochbaum, D. Hochbaum, 1998, APPROX.

ONTHE COMPLEXITY OF THE PRODUCTION-TRANSPORTATIONPROBLEM*

D. Hochbaum, Sung-Pil Hong, 1996 .

How to allocate review tasks for robust ranking

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2010, Acta Informatica.

The k-Allocation Problem and Its Variants

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2006, WAOA.

Rating Customers According to Their Promptness to Adopt New Products

Dorit S. Hochbaum, Erick Moreno-Centeno, Phillip Yelland, 2011, Oper. Res..

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

Dorit S. Hochbaum, Jonathan Bodine, D. Hochbaum, 2020, KDIR.

A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems

Cheng Lu, Dorit S. Hochbaum, D. Hochbaum, 2017, SIAM J. Optim..

When are NP-hard location problems easy?

Dorit S. Hochbaum, D. Hochbaum, 1984, Ann. Oper. Res..

Optimizing over Consecutive 1's and Circular 1's Constraints

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2006, SIAM J. Optim..

A focused issue on supply chain management

Mitsuo Gen, Dorit S. Hochbaum, Young Hae Lee, 2002 .

Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets

Quico Spaen, Dorit S. Hochbaum, Philipp Baumann, 2016, ICPRAM.

Sparse computation for large-scale data mining

Dorit S. Hochbaum, Philipp Baumann, D. Hochbaum, 2014, 2014 IEEE International Conference on Big Data (Big Data).

Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms

Dorit S. Hochbaum, Asaf Levin, D. Hochbaum, 2006, Discret. Optim..

Why Should Biconnected Components be Identified First

Dorit S. Hochbaum, D. Hochbaum, 1993, Discret. Appl. Math..

A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

Dorit S. Hochbaum, Bala G. Chandran, D. Hochbaum, 2009, Oper. Res..

A nonlinear Knapsack problem

Dorit S. Hochbaum, D. Hochbaum, 1995, Oper. Res. Lett..

A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time

D. Hochbaum, Jonathan Bodine, 2022, SN Computer Science.

A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time

D. Hochbaum, Jonathan Bodine, 2022 .

A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine

Fabián A. Chudak, Dorit S. Hochbaum, D. Hochbaum, 1999, Oper. Res. Lett..

Nuclear threat detection with mobile distributed sensor networks

Dorit S. Hochbaum, Barak Fishbain, D. Hochbaum, 2011, Ann. Oper. Res..

A New and Fast Approach to Very Large Scale Integrated Sequential Circuit Test Generation

Dorit S. Hochbaum, J. B. Adams, D. Hochbaum, 1997, Oper. Res..

On Hardness of Multiflow Transmission in Delay Constrained Cooperative Wireless Networks

Bhaskar Krishnamachari, Dorit S. Hochbaum, Marjan A. Baghaie, 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

Efficient algorithms to discover alterations with complementary functional association in cancer.

D. Hochbaum, Fabio Vandin, Rebecca Sarto Basso, 2018, PLoS computational biology.

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

Dorit S. Hochbaum, Ravindra K. Ahuja, James B. Orlin, 2004, Algorithmica.

Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits

Roberto Javier Asín Achá, D. Hochbaum, Catalina Pezo, 2023, ArXiv.

Efficient algorithms to discover alterations with complementary functional association in cancer

Rebecca Sarto Basso, D. Hochbaum, Fabio Vandin, 2018, PLoS Comput. Biol..

An efficient algorithm for Co-segmentation

Vikas Singh, Dorit S. Hochbaum, D. Hochbaum, 2009, 2009 IEEE 12th International Conference on Computer Vision.

A competitive study of the pseudoflow algorithm for the minimum s–t cut problem in vision applications

Dorit S. Hochbaum, Barak Fishbain, Stefan Müller, 2016, Journal of Real-Time Image Processing.

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

Dorit S. Hochbaum, Barak Fishbain, Stefan Müller, 2010, ArXiv.

The inequality-satisfiability problem

Dorit S. Hochbaum, Erick Moreno-Centeno, D. Hochbaum, 2008, Oper. Res. Lett..

The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials

Dorit S. Hochbaum, Barak Fishbain, Yan T. Yang, 2014, INFORMS J. Comput..

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba, D. Hochbaum, 1997, SIGA.

Minimizing a Convex Cost Closure Set

Maurice Queyranne, Dorit S. Hochbaum, D. Hochbaum, 2000, SIAM J. Discret. Math..

Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

Ron Shamir, Dorit S. Hochbaum, R. Shamir, 1991, Oper. Res..

The Complexity of Nonlinear Separable Optimization

J. George Shanthikumar, Dorit S. Hochbaum, D. Hochbaum, 1989, ICALP.

A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1986, FSTTCS.

A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem

Dorit S. Hochbaum, D. Hochbaum, 2016, Comput. Ind. Eng..

Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems

Dorit S. Hochbaum, Cheng Lu, D. Hochbaum, 2020, SIAM Journal on Optimization.

Simplifications and speedups of the pseudoflow algorithm

Dorit S. Hochbaum, James B. Orlin, D. Hochbaum, 2012, Networks.

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

Dorit S. Hochbaum, Dan Landy, D. Hochbaum, 1997, Oper. Res..

Benchmark Problems for Totally Unimodular Set System Auction pdf

Dorit S. Hochbaum, Ilan Adler, I. Adler, 2011, ArXiv.

An optimal test compression procedure for combinational circuits

Dorit S. Hochbaum, D. Hochbaum, 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

IEOR 269, Spring 2010 Integer Programming and Combinatorial Optimization

D. Hochbaum, 2010 .

Detecting Aberrant Linking Behavior in Directed Networks

Quico Spaen, Mark Velednitsky, Dorit S. Hochbaum, 2019, KDIR.

Complexity of some inverse shortest path lengths problems

Dorit S. Hochbaum, Tingting Cui, D. Hochbaum, 2010, Networks.

Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations

Dorit S. Hochbaum, D. Hochbaum, 2002, Eur. J. Oper. Res..

Scheduling with Batching: Two Job Types

Dorit S. Hochbaum, Dan Landy, D. Hochbaum, 1997, Discret. Appl. Math..

Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem

Dorit S. Hochbaum, Anna Chen, D. Hochbaum, 2000, Oper. Res..

Complexity and algorithms for convex network optimization and other nonlinear problems

Dorit S. Hochbaum, D. Hochbaum, 2005, 4OR.