The following pages link to Dorit S. Hochbaum (Q242829):
Displaying 29 items.
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime (Q4384087) (← links)
- (Q4400848) (← links)
- (Q4400849) (← links)
- Minimizing a Convex Cost Closure Set (Q4443080) (← links)
- A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q4602345) (← links)
- Security routing games with multivehicle Chinese postman problem (Q4642467) (← links)
- Asymptotically Optimal Linear Algorithm for the Minimum <i>k</i>-Cut in a Random Graph (Q4710964) (← links)
- Minimax problems with bitonic matrices (Q4785227) (← links)
- The SONET edge‐partition problem (Q4797943) (← links)
- On the Complexity of the Production-Transportation Problem (Q4877515) (← links)
- Approximation Algorithms for the <i>k</i>-Clique Covering Problem (Q4895634) (← links)
- Approximation Algorithms for Network Design Problems on Bounded Subsets (Q4895810) (← links)
- The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem (Q5129198) (← links)
- Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing (Q5131538) (← links)
- A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem (Q5189003) (← links)
- The multi‐integer set cover and the facility terminal cover problem (Q5191129) (← links)
- Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q5222132) (← links)
- A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant (Q5301120) (← links)
- Simplifications and speedups of the pseudoflow algorithm (Q5326778) (← links)
- An efficient algorithm for image segmentation, Markov random fields and related problems (Q5441355) (← links)
- Covering the Edges of Bipartite Graphs Using K 2,2 Graphs (Q5443377) (← links)
- The k-Allocation Problem and Its Variants (Q5443524) (← links)
- Convex separable optimization is not much harder than linear optimization (Q5753748) (← links)
- Scheduling with batching: Two job types (Q5961608) (← links)
- Applications and efficient algorithms for integer programming problems on monotone constraints (Q6087067) (← links)
- Obituary for Professor Emeritus Jakob Kraurp (Q6113302) (← links)
- Algorithms and Complexities of Matching Variants in Covariate Balancing (Q6195080) (← links)
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques (Q6659088) (← links)
- A Fast and Effective Breakpoints Algorithm for the Quadratic Knapsack Problem (Q6741322) (← links)
