×

zbMATH — the first resource for mathematics

Hochbaum, Dorit S.

Compute Distance To:
Author ID: hochbaum.dorit-s Recent zbMATH articles by "Hochbaum, Dorit S."
Published as: Hochbaum, Dorit S.; Hochbaum, D. S.; Hochbaum, Dorit
External Links: MGP · Wikidata · GND · IdRef
Documents Indexed: 121 Publications since 1980, including 2 Books

Publications by Year

Citations contained in zbMATH Open

97 Publications have been cited 1,609 times in 1,344 Documents Cited by Year
Approximation schemes for covering and packing problems in image processing and VLSI. Zbl 0633.68027
Hochbaum, Dorit S.; Maass, Wolfgang
151
1985
Approximation algorithms for NP-hard problems. Zbl 1368.68010
Hochbaum, Dorit S. (ed.)
106
1996
Approximation algorithms for the set covering and vertex cover problems. Zbl 0486.68067
Hochbaum, Dorit S.
96
1982
A best possible heuristic for the k-center problem. Zbl 0565.90015
Hochbaum, Dorit S.; Shmoys, David B.
96
1985
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. Zbl 0647.68040
Hochbaum, Dorit S.; Shmoys, David B.
70
1988
Convex separable optimization is not much harder than linear optimization. Zbl 0721.90060
Hochbaum, Dorit S.; Shanthikumar, J. George
62
1990
Efficient bounds for the stable set, vertex cover and set packing problems. Zbl 0523.05055
Hochbaum, Dorit S.
51
1983
A polynomial algorithm for the \(k\)-cut problem for fixed \(k\). Zbl 0809.90125
Goldschmidt, Olivier; Hochbaum, Dorit S.
42
1994
Scheduling semiconductor burn-in operations to minimize total flowtime. Zbl 0895.90116
Hochbaum, Dorit S.; Landy, Dan
40
1997
Simple and fast algorithms for linear and integer programs with two variables per inequality. Zbl 0831.90089
Hochbaum, Dorit S.; Naor, Joseph
39
1994
Heuristics for the fixed cost median problem. Zbl 0473.90029
Hochbaum, Dorit S.
38
1982
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Zbl 0802.90080
Hochbaum, Dorit S.; Megiddo, Nimrod; Naor, Joseph; Tamir, Arie
34
1993
Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Zbl 0820.90082
Hochbaum, Dorit S.
33
1994
A nonlinear knapsack problem. Zbl 0838.90092
Hochbaum, Dorit S.
32
1995
About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Zbl 0844.90061
Hochbaum, Dorit S.; Hong, Sung-Pil
31
1995
Strongly polynomial algorithms for the high multiplicity scheduling problem. Zbl 0736.90043
Hochbaum, Dorit S.; Shamir, Ron
30
1991
A fast approximation algorithm for the multicovering problem. Zbl 0602.90110
Hall, Nicholas G.; Hochbaum, Dorit S.
28
1986
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Zbl 0920.90137
Chudak, Fabián A.; Goemans, Michel X.; Hochbaum, Dorit S.; Williamson, David P.
28
1998
An efficient algorithm for image segmentation, Markov random fields and related problems. Zbl 1127.68474
Hochbaum, Dorit S.
24
2001
The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Zbl 1167.90394
Hochbaum, Dorit S.
22
2008
Approximating clique and biclique problems. Zbl 0919.68056
Hochbaum, Dorit S.
22
1998
Scheduling with batching: Minimizing the weighted number of tardy jobs. Zbl 0820.90052
Hochbaum, Dorit S.; Landy, Dan
21
1994
Analysis of the greedy approach in problems of maximum \(k\)-coverage. Zbl 0938.90026
Hochbaum, Dorit S.; Pathria, Anu
21
1998
Solving the convex cost integer dual network flow problem. Zbl 1232.90317
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.
20
2003
Database location in computer networks. Zbl 0445.68071
Fisher, Marshall L.; Hochbaum, Dorit S.
20
1980
Efficient algorithms for the inverse spanning-tree problem. Zbl 1165.90658
Hochbaum, Dorit S.
20
2003
Analysis of a flow problem with fixed charges. Zbl 0673.90035
Hochbaum, Dorit S.; Segev, Arie
19
1989
Capacity acquisition, subcontracting, and lot sizing. Zbl 1232.90008
Atamtürk, Alper; Hochbaum, Dorit S.
18
2001
An algorithm for the detection and construction of Monge sequences. Zbl 0666.65044
Alon, Noga; Cosares, Steven; Hochbaum, Dorit S.; Shamir, Ron
18
1989
Minimizing the number of tardy job units under release time constraints. Zbl 0707.90049
Hochbaum, Dorit S.; Shamir, Ron
18
1990
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Zbl 0958.90042
Chudak, Fabián A.; Hochbaum, Dorit S.
16
1999
The SONET edge-partition problem. Zbl 1026.90076
Goldschmidt, Olivier; Hochbaum, Dorit S.; Levin, Asaf; Olinick, Eli V.
16
2003
Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Zbl 0802.90073
Cosares, Steven; Hochbaum, Dorit S.
15
1994
Minimizing a convex Cost closure set. Zbl 1041.68070
Hochbaum, Dorit S.; Queyranne, Maurice
15
2003
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. Zbl 1001.90050
Hochbaum, Dorit S.
14
2002
Probabilistic analysis of the planar K-median problem. Zbl 0435.90057
Fisher, M. L.; Hochbaum, D. S.
13
1980
Fast approximation algorithms for a nonconvex covering problem. Zbl 0636.68082
Hochbaum, Dorit S.; Maass, Wolfgang
13
1987
Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms. Zbl 1112.90023
Hochbaum, Dorit S.; Levin, Asaf
13
2006
Complexity and algorithms for nonlinear optimization problems. Zbl 1159.90485
Hochbaum, Dorit S.
13
2007
A polynomial algorithm for an integer quadratic non-separable transportation problem. Zbl 0761.90061
Hochbaum, Dorit S.; Shamir, Ron; Shanthikumar, J. George
12
1992
A modified greedy heuristic for the set covering problem with improved worst case bound. Zbl 0811.68099
Goldschmidt, Olivier; Hochbaum, Dorit S.; Yu, Gang
11
1993
The \(t\)-vertex cover problem: Extending the half integrality framework with budget constraints. Zbl 0908.90213
Hochbaum, Dorit S.
11
1998
\(k\)-edge subgraph problems. Zbl 0870.68111
Goldschmidt, Olivier; Hochbaum, Dorit S.
10
1997
A better than ”best possible” algorithm to edge color multigraphs. Zbl 0594.68041
Hochbaum, Dorit S.; Nishizeki, Takao; Shmoys, David B.
10
1986
A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Zbl 1181.90271
Chandran, Bala G.; Hochbaum, Dorit S.
10
2009
Complexity and algorithms for convex network optimization and other nonlinear problems. Zbl 1099.90059
Hochbaum, Dorit S.
10
2005
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane. Zbl 0866.68076
Garg, N.; Hochbaum, D. S.
8
1997
An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem. Zbl 0672.68011
Hochbaum, Dorit S.; Shamir, Ron
8
1989
A new-old algorithm for minimum-cut and maximum-flow in closure graphs. Zbl 1044.90083
Hochbaum, Dorit S.
8
2001
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem. Zbl 1134.90512
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.
8
2004
Optimizing over consecutive 1’s and circular 1’s constraints. Zbl 1165.90607
Hochbaum, Dorit S.; Levin, Asaf
7
2006
Monotonizing linear programs with up to two nonzeroes per column. Zbl 1056.90105
Hochbaum, Dorit S.
7
2004
Approximation algorithms for the \(k\)-clique covering problem. Zbl 0857.05086
Goldschmidt, Olivier; Hochbaum, Dorit S.; Hurkens, Cor; Yu, Gang
6
1996
Solving linear cost dynamic lot-sizing problems in \(O(n \log n)\) time. Zbl 1167.90307
Ahuja, Ravindra K.; Hochbaum, Dorit S.
6
2008
Generalized \(p\)-center problems: Complexity results and approximation algorithms. Zbl 0918.90098
Hochbaum, Dorit S.; Pathria, Anu
6
1997
Solving the convex cost integer dual network flow problem. Zbl 0948.90116
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.
6
1999
Steinhaus’s geometric location problem for random samples in the plane. Zbl 0501.60040
Hochbaum, Dorit; Steele, J. Michael
5
1982
Instant recognition of half integrality and 2-approximations. Zbl 0911.90261
Hochbaum, Dorit S.
4
1998
A polynomial time algorithm for Rayleigh ratio on discrete variables: replacing spectral techniques for expander ratio, normalized cut, and Cheeger constant. Zbl 1267.90149
Hochbaum, Dorit S.
4
2013
Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization. Zbl 1289.68201
Hochbaum, Dorit S.
4
2013
Why should biconnected components be identified first. Zbl 0789.90084
Hochbaum, Dorit S.
4
1993
On the fractional solution to the set covering problem. Zbl 0518.90055
Hochbaum, Dorit S.
4
1983
An \(O(| V| ^ 2)\) algorithm for the planar 3-cut problem. Zbl 0572.05040
Hochbaum, Dorit S.; Shmoys, David B.
4
1985
The bottleneck graph partition problem. Zbl 0873.90102
Hochbaum, Dorit S.; Pathria, Anu
3
1996
On the complexity of the production-transportation problem. Zbl 0845.90087
Hochbaum, Dorit S.; Hong, Sung-Pil
3
1996
Nuclear threat detection with mobile distributed sensor networks. Zbl 1225.90016
Hochbaum, Dorit S.; Fishbain, Barak
3
2011
An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane. Zbl 1344.68285
Garg, Naveen; Hochbaum, Dorit S.
3
1994
Security routing games with multivehicle Chinese postman problem. Zbl 1390.90167
Hochbaum, Dorit S.; Lyu, Cheng; Ordóñez, Fernando
3
2014
Complexity of some inverse shortest path lengths problems. Zbl 1208.05141
Cui, Tingting; Hochbaum, Dorit S.
3
2010
The bounded cycle-cover problem. Zbl 1238.90131
Hochbaum, Dorit S.; Olinick, Eli V.
3
2001
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. Zbl 0956.90019
Hochbaum, Dorit S.; Woeginger, Gerhard J.
3
1999
The multicovering problem. Zbl 0759.90072
Hall, Nicholas G.; Hochbaum, Dorit S.
2
1992
Scheduling with batching: Two job types. Zbl 0873.90050
Hochbaum, Dorit S.; Landy, Dan
2
1997
The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. Zbl 0911.90154
Hochbaum, Dorit S.
2
1998
Evaluating performance of image segmentation criteria and techniques. Zbl 1307.90006
Hochbaum, Dorit S.; Lyu, Cheng; Bertelli, Erik
2
2013
A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems. Zbl 1383.90009
Hochbaum, Dorit S.; Lu, Cheng
2
2017
Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem. Zbl 0596.90093
Hochbaum, Dorit S.; Shmoys, David B.
2
1986
When are NP-hard location problems easy? Zbl 0671.90019
Hochbaum, Dorit S.
2
1984
Approximation schemes for covering and packing problems in robotics and VLSI. Zbl 0557.68035
Hochbaum, Dorit S.; Maass, Wolfgang
2
1984
Rating customers according to their promptness to adopt new products. Zbl 1233.90204
Hochbaum, Dorit S.; Moreno-Centeno, Erick; Yelland, Phillip; Catena, Rodolfo A.
1
2011
Simplifications and speedups of the pseudoflow algorithm. Zbl 1269.90129
Hochbaum, Dorit S.; Orlin, James B.
1
2013
A comparative study of the leading machine learning techniques and two new optimization algorithms. Zbl 1403.90560
Baumann, P.; Hochbaum, D. S.; Yang, Y. T.
1
2019
How to allocate review tasks for robust ranking. Zbl 1210.90166
Hochbaum, Dorit S.; Levin, Asaf
1
2010
Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems. Zbl 1301.68273
Hochbaum, Dorit S.; Levin, Asaf
1
2013
Minimizing a convex cost closure set. Zbl 0974.90016
Hochbaum, Dorit S.; Queyranne, Maurice
1
2000
The empirical performance of a polynomial algorithm for constrained nonlinear optimization. Zbl 0786.90066
Hochbaum, Dorit S.; Seshadri, Sridhar
1
1993
Covering the edges of bipartite graphs using \(K_{2,2}\) graphs. Zbl 1187.68343
Hochbaum, Dorit S.; Levin, Asaf
1
2010
A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach. Zbl 0623.68033
Hochbaum, Dorit S.; Shmoys, David B.
1
1986
Minimax problems with bitonic matrices. Zbl 1020.90046
Hochbaum, Dorit S.; Tucker, Paul A.
1
2002
Easy solutions for the K-center problem or the dominating set problem on random graphs. Zbl 0562.68029
Hochbaum, Dorit S.
1
1985
Approximating a generalization of MAX 2SAT and MIN 2SAT. Zbl 0971.68070
Hochbaum, Dorit S.; Pathria, Anu
1
2000
Algorithms and complexity of range clustering. Zbl 1416.62341
Hochbaum, Dorit S.
1
2019
Country credit-risk rating aggregation via the separation-deviation model. Zbl 1154.90335
Hochbaum, Dorit S.; Moreno-Centeno, Erick
1
2008
Covering the edges of bipartite graphs using \(K _{2,2}\) graphs. Zbl 1130.90409
Hochbaum, Dorit S.; Levin, Asaf
1
2008
A fast perfect-matching algorithm in random graphs. Zbl 0733.05072
Goldschmidt, Oliver; Hochbaum, Dorit S.
1
1990
The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem. Zbl 1444.90014
Hochbaum, Dorit S.; Rao, Xu
1
2019
Adjacency-clustering and its application for yield prediction in integrated circuit manufacturing. Zbl 1446.90066
Hochbaum, Dorit S.; Liu, Sheng
1
2018
A comparative study of the leading machine learning techniques and two new optimization algorithms. Zbl 1403.90560
Baumann, P.; Hochbaum, D. S.; Yang, Y. T.
1
2019
Algorithms and complexity of range clustering. Zbl 1416.62341
Hochbaum, Dorit S.
1
2019
The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem. Zbl 1444.90014
Hochbaum, Dorit S.; Rao, Xu
1
2019
Adjacency-clustering and its application for yield prediction in integrated circuit manufacturing. Zbl 1446.90066
Hochbaum, Dorit S.; Liu, Sheng
1
2018
A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems. Zbl 1383.90009
Hochbaum, Dorit S.; Lu, Cheng
2
2017
Security routing games with multivehicle Chinese postman problem. Zbl 1390.90167
Hochbaum, Dorit S.; Lyu, Cheng; Ordóñez, Fernando
3
2014
A polynomial time algorithm for Rayleigh ratio on discrete variables: replacing spectral techniques for expander ratio, normalized cut, and Cheeger constant. Zbl 1267.90149
Hochbaum, Dorit S.
4
2013
Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization. Zbl 1289.68201
Hochbaum, Dorit S.
4
2013
Evaluating performance of image segmentation criteria and techniques. Zbl 1307.90006
Hochbaum, Dorit S.; Lyu, Cheng; Bertelli, Erik
2
2013
Simplifications and speedups of the pseudoflow algorithm. Zbl 1269.90129
Hochbaum, Dorit S.; Orlin, James B.
1
2013
Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems. Zbl 1301.68273
Hochbaum, Dorit S.; Levin, Asaf
1
2013
Nuclear threat detection with mobile distributed sensor networks. Zbl 1225.90016
Hochbaum, Dorit S.; Fishbain, Barak
3
2011
Rating customers according to their promptness to adopt new products. Zbl 1233.90204
Hochbaum, Dorit S.; Moreno-Centeno, Erick; Yelland, Phillip; Catena, Rodolfo A.
1
2011
Complexity of some inverse shortest path lengths problems. Zbl 1208.05141
Cui, Tingting; Hochbaum, Dorit S.
3
2010
How to allocate review tasks for robust ranking. Zbl 1210.90166
Hochbaum, Dorit S.; Levin, Asaf
1
2010
Covering the edges of bipartite graphs using \(K_{2,2}\) graphs. Zbl 1187.68343
Hochbaum, Dorit S.; Levin, Asaf
1
2010
A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Zbl 1181.90271
Chandran, Bala G.; Hochbaum, Dorit S.
10
2009
The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Zbl 1167.90394
Hochbaum, Dorit S.
22
2008
Solving linear cost dynamic lot-sizing problems in \(O(n \log n)\) time. Zbl 1167.90307
Ahuja, Ravindra K.; Hochbaum, Dorit S.
6
2008
Country credit-risk rating aggregation via the separation-deviation model. Zbl 1154.90335
Hochbaum, Dorit S.; Moreno-Centeno, Erick
1
2008
Covering the edges of bipartite graphs using \(K _{2,2}\) graphs. Zbl 1130.90409
Hochbaum, Dorit S.; Levin, Asaf
1
2008
Complexity and algorithms for nonlinear optimization problems. Zbl 1159.90485
Hochbaum, Dorit S.
13
2007
Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms. Zbl 1112.90023
Hochbaum, Dorit S.; Levin, Asaf
13
2006
Optimizing over consecutive 1’s and circular 1’s constraints. Zbl 1165.90607
Hochbaum, Dorit S.; Levin, Asaf
7
2006
Complexity and algorithms for convex network optimization and other nonlinear problems. Zbl 1099.90059
Hochbaum, Dorit S.
10
2005
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem. Zbl 1134.90512
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.
8
2004
Monotonizing linear programs with up to two nonzeroes per column. Zbl 1056.90105
Hochbaum, Dorit S.
7
2004
Solving the convex cost integer dual network flow problem. Zbl 1232.90317
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.
20
2003
Efficient algorithms for the inverse spanning-tree problem. Zbl 1165.90658
Hochbaum, Dorit S.
20
2003
The SONET edge-partition problem. Zbl 1026.90076
Goldschmidt, Olivier; Hochbaum, Dorit S.; Levin, Asaf; Olinick, Eli V.
16
2003
Minimizing a convex Cost closure set. Zbl 1041.68070
Hochbaum, Dorit S.; Queyranne, Maurice
15
2003
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. Zbl 1001.90050
Hochbaum, Dorit S.
14
2002
Minimax problems with bitonic matrices. Zbl 1020.90046
Hochbaum, Dorit S.; Tucker, Paul A.
1
2002
An efficient algorithm for image segmentation, Markov random fields and related problems. Zbl 1127.68474
Hochbaum, Dorit S.
24
2001
Capacity acquisition, subcontracting, and lot sizing. Zbl 1232.90008
Atamtürk, Alper; Hochbaum, Dorit S.
18
2001
A new-old algorithm for minimum-cut and maximum-flow in closure graphs. Zbl 1044.90083
Hochbaum, Dorit S.
8
2001
The bounded cycle-cover problem. Zbl 1238.90131
Hochbaum, Dorit S.; Olinick, Eli V.
3
2001
Minimizing a convex cost closure set. Zbl 0974.90016
Hochbaum, Dorit S.; Queyranne, Maurice
1
2000
Approximating a generalization of MAX 2SAT and MIN 2SAT. Zbl 0971.68070
Hochbaum, Dorit S.; Pathria, Anu
1
2000
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Zbl 0958.90042
Chudak, Fabián A.; Hochbaum, Dorit S.
16
1999
Solving the convex cost integer dual network flow problem. Zbl 0948.90116
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.
6
1999
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. Zbl 0956.90019
Hochbaum, Dorit S.; Woeginger, Gerhard J.
3
1999
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Zbl 0920.90137
Chudak, Fabián A.; Goemans, Michel X.; Hochbaum, Dorit S.; Williamson, David P.
28
1998
Approximating clique and biclique problems. Zbl 0919.68056
Hochbaum, Dorit S.
22
1998
Analysis of the greedy approach in problems of maximum \(k\)-coverage. Zbl 0938.90026
Hochbaum, Dorit S.; Pathria, Anu
21
1998
The \(t\)-vertex cover problem: Extending the half integrality framework with budget constraints. Zbl 0908.90213
Hochbaum, Dorit S.
11
1998
Instant recognition of half integrality and 2-approximations. Zbl 0911.90261
Hochbaum, Dorit S.
4
1998
The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. Zbl 0911.90154
Hochbaum, Dorit S.
2
1998
Scheduling semiconductor burn-in operations to minimize total flowtime. Zbl 0895.90116
Hochbaum, Dorit S.; Landy, Dan
40
1997
\(k\)-edge subgraph problems. Zbl 0870.68111
Goldschmidt, Olivier; Hochbaum, Dorit S.
10
1997
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane. Zbl 0866.68076
Garg, N.; Hochbaum, D. S.
8
1997
Generalized \(p\)-center problems: Complexity results and approximation algorithms. Zbl 0918.90098
Hochbaum, Dorit S.; Pathria, Anu
6
1997
Scheduling with batching: Two job types. Zbl 0873.90050
Hochbaum, Dorit S.; Landy, Dan
2
1997
Approximation algorithms for NP-hard problems. Zbl 1368.68010
Hochbaum, Dorit S.
106
1996
Approximation algorithms for the \(k\)-clique covering problem. Zbl 0857.05086
Goldschmidt, Olivier; Hochbaum, Dorit S.; Hurkens, Cor; Yu, Gang
6
1996
The bottleneck graph partition problem. Zbl 0873.90102
Hochbaum, Dorit S.; Pathria, Anu
3
1996
On the complexity of the production-transportation problem. Zbl 0845.90087
Hochbaum, Dorit S.; Hong, Sung-Pil
3
1996
A nonlinear knapsack problem. Zbl 0838.90092
Hochbaum, Dorit S.
32
1995
About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Zbl 0844.90061
Hochbaum, Dorit S.; Hong, Sung-Pil
31
1995
A polynomial algorithm for the \(k\)-cut problem for fixed \(k\). Zbl 0809.90125
Goldschmidt, Olivier; Hochbaum, Dorit S.
42
1994
Simple and fast algorithms for linear and integer programs with two variables per inequality. Zbl 0831.90089
Hochbaum, Dorit S.; Naor, Joseph
39
1994
Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Zbl 0820.90082
Hochbaum, Dorit S.
33
1994
Scheduling with batching: Minimizing the weighted number of tardy jobs. Zbl 0820.90052
Hochbaum, Dorit S.; Landy, Dan
21
1994
Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Zbl 0802.90073
Cosares, Steven; Hochbaum, Dorit S.
15
1994
An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane. Zbl 1344.68285
Garg, Naveen; Hochbaum, Dorit S.
3
1994
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Zbl 0802.90080
Hochbaum, Dorit S.; Megiddo, Nimrod; Naor, Joseph; Tamir, Arie
34
1993
A modified greedy heuristic for the set covering problem with improved worst case bound. Zbl 0811.68099
Goldschmidt, Olivier; Hochbaum, Dorit S.; Yu, Gang
11
1993
Why should biconnected components be identified first. Zbl 0789.90084
Hochbaum, Dorit S.
4
1993
The empirical performance of a polynomial algorithm for constrained nonlinear optimization. Zbl 0786.90066
Hochbaum, Dorit S.; Seshadri, Sridhar
1
1993
A polynomial algorithm for an integer quadratic non-separable transportation problem. Zbl 0761.90061
Hochbaum, Dorit S.; Shamir, Ron; Shanthikumar, J. George
12
1992
The multicovering problem. Zbl 0759.90072
Hall, Nicholas G.; Hochbaum, Dorit S.
2
1992
Strongly polynomial algorithms for the high multiplicity scheduling problem. Zbl 0736.90043
Hochbaum, Dorit S.; Shamir, Ron
30
1991
Convex separable optimization is not much harder than linear optimization. Zbl 0721.90060
Hochbaum, Dorit S.; Shanthikumar, J. George
62
1990
Minimizing the number of tardy job units under release time constraints. Zbl 0707.90049
Hochbaum, Dorit S.; Shamir, Ron
18
1990
A fast perfect-matching algorithm in random graphs. Zbl 0733.05072
Goldschmidt, Oliver; Hochbaum, Dorit S.
1
1990
Analysis of a flow problem with fixed charges. Zbl 0673.90035
Hochbaum, Dorit S.; Segev, Arie
19
1989
An algorithm for the detection and construction of Monge sequences. Zbl 0666.65044
Alon, Noga; Cosares, Steven; Hochbaum, Dorit S.; Shamir, Ron
18
1989
An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem. Zbl 0672.68011
Hochbaum, Dorit S.; Shamir, Ron
8
1989
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. Zbl 0647.68040
Hochbaum, Dorit S.; Shmoys, David B.
70
1988
Fast approximation algorithms for a nonconvex covering problem. Zbl 0636.68082
Hochbaum, Dorit S.; Maass, Wolfgang
13
1987
A fast approximation algorithm for the multicovering problem. Zbl 0602.90110
Hall, Nicholas G.; Hochbaum, Dorit S.
28
1986
A better than ”best possible” algorithm to edge color multigraphs. Zbl 0594.68041
Hochbaum, Dorit S.; Nishizeki, Takao; Shmoys, David B.
10
1986
Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem. Zbl 0596.90093
Hochbaum, Dorit S.; Shmoys, David B.
2
1986
A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach. Zbl 0623.68033
Hochbaum, Dorit S.; Shmoys, David B.
1
1986
Approximation schemes for covering and packing problems in image processing and VLSI. Zbl 0633.68027
Hochbaum, Dorit S.; Maass, Wolfgang
151
1985
A best possible heuristic for the k-center problem. Zbl 0565.90015
Hochbaum, Dorit S.; Shmoys, David B.
96
1985
An \(O(| V| ^ 2)\) algorithm for the planar 3-cut problem. Zbl 0572.05040
Hochbaum, Dorit S.; Shmoys, David B.
4
1985
Easy solutions for the K-center problem or the dominating set problem on random graphs. Zbl 0562.68029
Hochbaum, Dorit S.
1
1985
When are NP-hard location problems easy? Zbl 0671.90019
Hochbaum, Dorit S.
2
1984
Approximation schemes for covering and packing problems in robotics and VLSI. Zbl 0557.68035
Hochbaum, Dorit S.; Maass, Wolfgang
2
1984
Efficient bounds for the stable set, vertex cover and set packing problems. Zbl 0523.05055
Hochbaum, Dorit S.
51
1983
On the fractional solution to the set covering problem. Zbl 0518.90055
Hochbaum, Dorit S.
4
1983
Approximation algorithms for the set covering and vertex cover problems. Zbl 0486.68067
Hochbaum, Dorit S.
96
1982
Heuristics for the fixed cost median problem. Zbl 0473.90029
Hochbaum, Dorit S.
38
1982
Steinhaus’s geometric location problem for random samples in the plane. Zbl 0501.60040
Hochbaum, Dorit; Steele, J. Michael
5
1982
Database location in computer networks. Zbl 0445.68071
Fisher, Marshall L.; Hochbaum, Dorit S.
20
1980
Probabilistic analysis of the planar K-median problem. Zbl 0435.90057
Fisher, M. L.; Hochbaum, D. S.
13
1980
all top 5

Cited by 2,199 Authors

36 Hochbaum, Dorit S.
15 Levin, Asaf
13 Das, Gautam Kumar
13 Subramani, Krishnan
13 Zhang, Zhao
12 Paschos, Vangelis Th.
11 Cheng, Tai-Chiu Edwin
11 Xu, Dachuan
10 Du, Ding-Zhu
9 Chan, Timothy Moon-Yew
9 Hassin, Refael
9 Jansen, Klaus
9 Kovalyov, Mikhail Yakovlevich
9 Nandy, Subhas Chandra
9 Pardalos, Panos M.
9 Shioura, Akiyoshi
9 Strusevich, Vitaly A.
9 Woeginger, Gerhard Johannes
9 Wu, Weili
8 Rawitz, Dror
8 Shakhlevich, Natalia V.
8 Trystram, Denis R.
8 Wu, Chenchen
8 Xu, Chao
7 Brauner, Nadia
7 Chen, Jian-er
7 Epstein, Leah
7 Guan, Xiucui
7 Ibaraki, Toshihide
7 Ray, Saurabh
7 Wang, Jianxin
6 Atamtürk, Alper
6 Chekuri, Chandra S.
6 Crama, Yves
6 Du, Donglei
6 Escoffier, Bruno
6 Hermelin, Danny
6 Huang, Wenqi
6 Jallu, Ramesh K.
6 Kakimura, Naonori
6 Kellerer, Johann
6 Li, Duan
6 Marathe, Madhav V.
6 Murota, Kazuo
6 Mustafa, Nabil Hassan
6 Razzazi, Mohammadreza
6 Rudolf, Rudiger
6 Segev, Danny
6 Steiner, George
6 Tu, Jianhua
6 Vohra, Rakesh V.
6 Zhang, Jiawei
6 Zissimopoulos, Vassilis
5 Burkard, Rainer E.
5 Chambolle, Antonin
5 El Ouali, Mourad
5 Fiorini, Samuel
5 Fujito, Toshihiro
5 Goldreich, Oded
5 Grigoriev, Alexander
5 Ito, Takehiro
5 Kortsarz, Guy
5 Krumke, Sven Oliver
5 Leung, Joseph Y.-T.
5 Li, Guojun
5 Lingas, Andrzej
5 Milis, Ioannis
5 Monnot, Jérôme
5 Pandit, Supantha
5 Parekh, Ojas
5 Shamir, Ron
5 Shetty, Bala
5 Srivastav, Anand
5 Sung, Chang Sup
5 Tamir, Arie
5 Teo, Chungpiaw
5 Wang, Wei
5 Xiao, Mingyu
5 Yagiura, Mutsunori
5 Zhang, Binwu
5 Zhang, Dongmei
5 Zhang, Jianzhong
4 Agnetis, Alessandro
4 Bar-Yehuda, Reuven
4 Basappa, Manjanna
4 Bertsimas, Dimitris John
4 Bretthauer, Kurt M.
4 Bus, Norbert
4 Damaschke, Peter
4 Darbon, Jerome
4 Demange, Marc
4 Detti, Paolo
4 Fellows, Michael Ralph
4 Fomin, Fedor V.
4 Fraser, Robert
4 Gaspers, Serge
4 Geunes, Joseph
4 Ghasemi, Taha
4 Ghiyasvand, Mehdi
4 Gómez, Andrés
...and 2,099 more Authors
all top 5

Cited in 177 Serials

115 European Journal of Operational Research
109 Theoretical Computer Science
83 Discrete Applied Mathematics
76 Algorithmica
57 Journal of Combinatorial Optimization
47 Information Processing Letters
47 Mathematical Programming. Series A. Series B
46 Computers & Operations Research
39 Operations Research Letters
34 Annals of Operations Research
34 Discrete Optimization
32 Journal of Scheduling
22 Journal of Computer and System Sciences
20 Computational Geometry
18 Networks
18 International Journal of Foundations of Computer Science
18 Journal of Global Optimization
18 Theory of Computing Systems
13 Mathematics of Operations Research
12 Discrete Mathematics
12 Optimization Letters
11 International Journal of Computational Geometry & Applications
11 Journal of Discrete Algorithms
10 SIAM Journal on Computing
10 RAIRO. Operations Research
9 Operations Research
9 SIAM Journal on Optimization
8 Discrete & Computational Geometry
8 INFORMS Journal on Computing
7 International Journal of Production Research
7 Computational Optimization and Applications
7 Top
6 Naval Research Logistics
6 SIAM Journal on Discrete Mathematics
5 Information Sciences
5 Optimization
5 Linear Algebra and its Applications
5 Journal of Heuristics
5 OR Spectrum
5 Journal of Industrial and Management Optimization
5 SIAM Journal on Imaging Sciences
5 Discrete Mathematics, Algorithms and Applications
4 Artificial Intelligence
4 Applied Mathematics and Computation
4 Journal of Optimization Theory and Applications
4 Information and Computation
4 Journal of Parallel and Distributed Computing
4 Games and Economic Behavior
4 Applied Mathematical Modelling
4 4OR
4 Journal of the Operations Research Society of China
4 Computer Science Review
3 BIT
3 Computing
3 Journal of Computational and Applied Mathematics
3 Combinatorica
3 Journal of Computer Science and Technology
3 Asia-Pacific Journal of Operational Research
3 Formal Aspects of Computing
3 Random Structures & Algorithms
3 International Journal of Computer Mathematics
3 Distributed Computing
3 International Journal of Computer Vision
3 Optimization Methods & Software
3 Mathematical Methods of Operations Research
3 Data Mining and Knowledge Discovery
3 Mathematical Programming Computation
2 Acta Informatica
2 Journal of Mathematical Physics
2 Chaos, Solitons and Fractals
2 Journal of Combinatorial Theory. Series B
2 Mathematica Slovaca
2 Statistica Neerlandica
2 European Journal of Combinatorics
2 OR Spektrum
2 SIAM Journal on Algebraic and Discrete Methods
2 Acta Mathematicae Applicatae Sinica. English Series
2 Graphs and Combinatorics
2 Mathematical and Computer Modelling
2 Queueing Systems
2 Real-Time Systems
2 The Annals of Applied Probability
2 Discrete Event Dynamic Systems
2 Computational Statistics and Data Analysis
2 Applied Mathematics. Series B (English Edition)
2 Combinatorics, Probability and Computing
2 Annals of Mathematics and Artificial Intelligence
2 Wuhan University Journal of Natural Sciences (WUJNS)
2 International Journal of Applied Mathematics and Computer Science
2 RAIRO. Theoretical Informatics and Applications
2 Trudy Instituta Matematiki
2 Sādhanā
2 JMMA. Journal of Mathematical Modelling and Algorithms
2 Acta Numerica
2 Computational Management Science
2 The Annals of Applied Statistics
2 Algorithms
1 Applicable Analysis
1 International Journal of Control
1 Inverse Problems
...and 77 more Serials

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.