| 2009 |
|---|
| 66 | EE | Dorit S. Hochbaum:
Dynamic evolution of economically preferred facilities.
European Journal of Operational Research 193(3): 649-659 (2009) |
| 65 | EE | Dorit S. Hochbaum,
Asaf Levin:
The multi-integer set cover and the facility terminal cover problem.
Networks 53(1): 63-66 (2009) |
| 2008 |
|---|
| 64 | EE | 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 abs/0803.0146: (2008) |
| 63 | EE | Dorit S. Hochbaum,
Erick Moreno-Centeno:
The inequality-satisfiability problem.
Oper. Res. Lett. 36(2): 229-233 (2008) |
| 2007 |
|---|
| 62 | EE | Dorit S. Hochbaum,
Asaf Levin:
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs.
WAOA 2007: 116-127 |
| 61 | EE | Dorit S. Hochbaum:
Complexity and algorithms for nonlinear optimization problems.
Annals OR 153(1): 257-296 (2007) |
| 2006 |
|---|
| 60 | EE | Dorit S. Hochbaum,
Asaf Levin:
The k-Allocation Problem and Its Variants.
WAOA 2006: 253-264 |
| 59 | EE | Dorit S. Hochbaum:
Ranking Sports Teams and the Inverse Equal Paths Problem.
WINE 2006: 307-318 |
| 58 | EE | Dorit S. Hochbaum,
Asaf Levin:
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms.
Discrete Optimization 3(4): 327-340 (2006) |
| 2005 |
|---|
| 57 | EE | Dorit S. Hochbaum:
Complexity and algorithms for convex network optimization and other nonlinear problems.
4OR 3(3): 171-216 (2005) |
| 2004 |
|---|
| 56 | EE | 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): 189-208 (2004) |
| 55 | EE | Dorit S. Hochbaum:
Monotonizing linear programs with up to two nonzeroes per column.
Oper. Res. Lett. 32(1): 49-58 (2004) |
| 2003 |
|---|
| 54 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum,
Asaf Levin,
Eli V. Olinick:
The SONET edge-partition problem.
Networks 41(1): 13-23 (2003) |
| 53 | EE | Dorit S. Hochbaum,
Maurice Queyranne:
Minimizing a Convex Cost Closure Set.
SIAM J. Discrete Math. 16(2): 192-207 (2003) |
| 2002 |
|---|
| 52 | EE | Dorit S. Hochbaum,
Paul A. Tucker:
Minimax problems with bitonic matrices.
Networks 40(3): 113-124 (2002) |
| 2001 |
|---|
| 51 | EE | Dorit S. Hochbaum,
Eli V. Olinick:
The Bounded Cycle-Cover Problem.
INFORMS Journal on Computing 13(2): 104-119 (2001) |
| 50 | EE | Dorit S. Hochbaum:
An efficient algorithm for image segmentation, Markov random fields and related problems.
J. ACM 48(4): 686-701 (2001) |
| 49 | EE | Dorit S. Hochbaum:
A new - old algorithm for minimum-cut and maximum-flow in closure graphs.
Networks 37(4): 171-193 (2001) |
| 2000 |
|---|
| 48 | EE | Dorit S. Hochbaum:
Instant recognition of polynominal time solvability, half integrality and 2-approximations.
APPROX 2000: 2-14 |
| 47 | | Dorit S. Hochbaum,
Maurice Queyranne:
Minimizing a Convex Cost Closure Set.
ESA 2000: 256-267 |
| 46 | | Dorit S. Hochbaum,
Anu Pathria:
Approximating a generalization of MAX 2SAT and MIN 2SAT.
Discrete Applied Mathematics 107(1-3): 41-59 (2000) |
| 1999 |
|---|
| 45 | | Dorit S. Hochbaum,
Klaus Jansen,
José D. P. Rolim,
Alistair Sinclair:
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
Springer 1999 |
| 44 | EE | Ravindra K. Ahuja,
Dorit S. Hochbaum,
James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem.
IPCO 1999: 31-44 |
| 43 | EE | Dorit S. Hochbaum,
Gerhard J. Woeginger:
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources.
Oper. Res. Lett. 24(1-2): 25-28 (1999) |
| 42 | EE | Fabián A. Chudak,
Dorit S. Hochbaum:
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine.
Oper. Res. Lett. 25(5): 199-204 (1999) |
| 1998 |
|---|
| 41 | | Klaus Jansen,
Dorit S. Hochbaum:
Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
Springer 1998 |
| 40 | EE | Dorit S. Hochbaum:
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints.
APPROX 1998: 111-122 |
| 39 | EE | Dorit S. Hochbaum:
Instant Recognition of Half Integrality and 2-Approximations.
APPROX 1998: 99-110 |
| 38 | EE | Dorit S. Hochbaum:
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem.
IPCO 1998: 325-337 |
| 37 | | Dorit S. Hochbaum:
Approximating Clique and Biclique Problems.
J. Algorithms 29(1): 174-200 (1998) |
| 36 | EE | Fabián A. Chudak,
Michel X. Goemans,
Dorit S. Hochbaum,
David P. Williamson:
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs.
Oper. Res. Lett. 22(4-5): 111-118 (1998) |
| 1997 |
|---|
| 35 | | Naveen Garg,
Dorit S. Hochbaum:
An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane.
Algorithmica 18(1): 111-121 (1997) |
| 34 | EE | Dorit S. Hochbaum,
Dan Landy:
Scheduling with Batching: Two Job Types.
Discrete Applied Mathematics 72(1-2): 99-114 (1997) |
| 33 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum:
k-edge Subgraph Problems.
Discrete Applied Mathematics 74(2): 159-169 (1997) |
| 32 | | Dorit S. Hochbaum,
Anu Pathria:
Path Costs in Evolutionary Tree Reconstruction.
Journal of Computational Biology 4(2): 163-176 (1997) |
| 1996 |
|---|
| 31 | EE | Dorit S. Hochbaum:
An optimal test compression procedure for combinational circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(10): 1294-1299 (1996) |
| 30 | | Dorit S. Hochbaum,
Joseph Naor:
Approximation Algorithms for Network Design Problems on Bounded Subsets.
J. Algorithms 21(2): 403-414 (1996) |
| 29 | EE | Dorit S. Hochbaum,
Anu Pathria:
The bottleneck graph partition problem.
Networks 28(4): 221-225 (1996) |
| 28 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum,
Cor A. J. Hurkens,
Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem.
SIAM J. Discrete Math. 9(3): 492-509 (1996) |
| 1995 |
|---|
| 27 | | Dorit S. Hochbaum,
Sung-Pil Hong:
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.
Math. Program. 69: 269-309 (1995) |
| 1994 |
|---|
| 26 | | Dorit S. Hochbaum,
Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality.
SIAM J. Comput. 23(6): 1179-1192 (1994) |
| 1993 |
|---|
| 25 | EE | Dorit S. Hochbaum:
Why Should Biconnected Components be Identified First.
Discrete Applied Mathematics 42(2): 203-210 (1993) |
| 24 | | Olivier Goldschmidt,
Dorit S. Hochbaum,
Gang Yu:
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.
Inf. Process. Lett. 48(6): 305-310 (1993) |
| 23 | | Dorit S. Hochbaum,
Nimrod Megiddo,
Joseph Naor,
Arie Tamir:
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.
Math. Program. 62: 69-83 (1993) |
| 1992 |
|---|
| 22 | | Dorit S. Hochbaum,
Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality.
IPCO 1992: 44-59 |
| 21 | | Dorit S. Hochbaum,
Ron Shamir,
J. George Shanthikumar:
A polynomial algorithm for an integer quadratic non-separable transportation problem.
Math. Program. 55: 359-371 (1992) |
| 1990 |
|---|
| 20 | | Dorit S. Hochbaum:
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions.
IPCO 1990: 261-273 |
| 19 | EE | Dorit S. Hochbaum,
Ron Shamir:
Minimizing the number of tardy job units under release time constraints.
Discrete Applied Mathematics 28(1): 45-57 (1990) |
| 18 | EE | Dorit S. Hochbaum,
J. George Shanthikumar:
Convex Separable Optimization Is Not Much Harder than Linear Optimization
J. ACM 37(4): 843-862 (1990) |
| 17 | | Olivier Goldschmidt,
Dorit S. Hochbaum:
A Fast Perfect-Matching Algorithm in Random Graphs.
SIAM J. Discrete Math. 3(1): 48-57 (1990) |
| 16 | | Olivier Goldschmidt,
Dorit S. Hochbaum:
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph.
SIAM J. Discrete Math. 3(1): 58-73 (1990) |
| 1989 |
|---|
| 15 | | Dorit S. Hochbaum,
J. George Shanthikumar:
The Complexity of Nonlinear Separable Optimization.
ICALP 1989: 461-472 |
| 14 | | Dorit S. Hochbaum,
Ron Shamir:
An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem.
Inf. Process. Lett. 31(4): 215-219 (1989) |
| 1988 |
|---|
| 13 | | Olivier Goldschmidt,
Dorit S. Hochbaum:
Polynomial Algorithm for the k-Cut Problem
FOCS 1988: 444-451 |
| 12 | | Dorit S. Hochbaum,
David B. Shmoys:
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach.
SIAM J. Comput. 17(3): 539-551 (1988) |
| 1987 |
|---|
| 11 | EE | Dorit S. Hochbaum,
David B. Shmoys:
Using dual approximation algorithms for scheduling problems theoretical and practical results.
J. ACM 34(1): 144-162 (1987) |
| 10 | | Dorit S. Hochbaum,
Wolfgang Maass:
Fast Approximation Algorithms for a Nonconvex Covering Problem.
J. Algorithms 8(3): 305-323 (1987) |
| 1986 |
|---|
| 9 | | Dorit S. Hochbaum,
David B. Shmoys:
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach.
FSTTCS 1986: 382-393 |
| 8 | EE | Dorit S. Hochbaum,
David B. Shmoys:
A unified approach to approximation algorithms for bottleneck problems.
J. ACM 33(3): 533-550 (1986) |
| 7 | | Dorit S. Hochbaum,
Takao Nishizeki,
David B. Shmoys:
A Better than "Best Possible" Algorithm to Edge Color Multigraphs.
J. Algorithms 7(1): 79-104 (1986) |
| 1985 |
|---|
| 6 | | Dorit S. Hochbaum,
David B. Shmoys:
Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results
FOCS 1985: 79-89 |
| 5 | EE | Dorit S. Hochbaum,
Wolfgang Maass:
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI
J. ACM 32(1): 130-136 (1985) |
| 1984 |
|---|
| 4 | | Dorit S. Hochbaum,
Wolfgang Maass:
Approximation Schemes for Covering and Packing Problems in Robotics and VLSI.
STACS 1984: 55-62 |
| 3 | | Dorit S. Hochbaum,
David B. Shmoys:
Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems
STOC 1984: 324-333 |
| 1982 |
|---|
| 2 | | Dorit S. Hochbaum:
Approximation Algorithms for the Set Covering and Vertex Cover Problems.
SIAM J. Comput. 11(3): 555-556 (1982) |
| 1980 |
|---|
| 1 | EE | Marshall L. Fisher,
Dorit S. Hochbaum:
Database Location in Computer Networks.
J. ACM 27(4): 718-735 (1980) |
