Asín Achá, Roberto; Hochbaum, Dorit S.; Spaen, Quico HNCcorr: combinatorial optimization for neuron identification. (English) Zbl 1496.90070 Ann. Oper. Res. 289, No. 1, 5-32 (2020). MSC: 90C27 90C90 PDFBibTeX XMLCite \textit{R. Asín Achá} et al., Ann. Oper. Res. 289, No. 1, 5--32 (2020; Zbl 1496.90070) Full Text: DOI
Hochbaum, Dorit S.; Rao, Xu A fully polynomial time approximation scheme for the replenishment storage problem. (English) Zbl 1525.90024 Oper. Res. Lett. 48, No. 6, 835-839 (2020). MSC: 90B05 90C10 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{X. Rao}, Oper. Res. Lett. 48, No. 6, 835--839 (2020; Zbl 1525.90024) Full Text: DOI arXiv
Hochbaum, Dorit S.; Rao, Xu The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem. (English) Zbl 1444.90014 Oper. Res. 67, No. 5, 1345-1361 (2019). MSC: 90B05 90B35 90C10 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{X. Rao}, Oper. Res. 67, No. 5, 1345--1361 (2019; Zbl 1444.90014) Full Text: DOI Link
Hochbaum, Dorit S.; Lyu, Cheng; Ordóñez, Fernando Security routing games with multivehicle Chinese postman problem. (English) Zbl 1390.90167 Networks 64, No. 3, 181-191 (2014). MSC: 90B18 91A12 PDFBibTeX XMLCite \textit{D. S. Hochbaum} et al., Networks 64, No. 3, 181--191 (2014; Zbl 1390.90167) Full Text: DOI
Hochbaum, Dorit S.; Levin, Asaf Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems. (English) Zbl 1301.68273 ACM Trans. Algorithms 9, No. 2, Article No. 19, 12 p. (2013). MSC: 68W25 68Q17 68T20 92D10 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{A. Levin}, ACM Trans. Algorithms 9, No. 2, Article No. 19, 12 p. (2013; Zbl 1301.68273) Full Text: DOI
Hochbaum, Dorit S.; Lyu, Cheng; Bertelli, Erik Evaluating performance of image segmentation criteria and techniques. (English) Zbl 1307.90006 EURO J. Comput. Optim. 1, No. 1-2, 155-180 (2013). MSC: 90-08 90B10 90C27 PDFBibTeX XMLCite \textit{D. S. Hochbaum} et al., EURO J. Comput. Optim. 1, No. 1--2, 155--180 (2013; Zbl 1307.90006) Full Text: DOI
Hochbaum, Dorit S.; Orlin, James B. Simplifications and speedups of the pseudoflow algorithm. (English) Zbl 1269.90129 Networks 61, No. 1, 40-57 (2013). MSC: 90C35 90C60 68P05 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{J. B. Orlin}, Networks 61, No. 1, 40--57 (2013; Zbl 1269.90129) Full Text: DOI Link
Hochbaum, Dorit S. A polynomial time algorithm for Rayleigh ratio on discrete variables: replacing spectral techniques for expander ratio, normalized cut, and Cheeger constant. (English) Zbl 1267.90149 Oper. Res. 61, No. 1, 184-198 (2013). MSC: 90C32 90C60 PDFBibTeX XMLCite \textit{D. S. Hochbaum}, Oper. Res. 61, No. 1, 184--198 (2013; Zbl 1267.90149) Full Text: DOI Link
Qranfal, Joe; Hochbaum, Dorit S.; Tanoh, Germain Experimental analysis of the MRF algorithm for segmentation of noisy medical images. (English) Zbl 1277.94006 Algorithmic Oper. Res. 6, No. 2, 79-90 (2011). MSC: 94A08 92C55 PDFBibTeX XMLCite \textit{J. Qranfal} et al., Algorithmic Oper. Res. 6, No. 2, 79--90 (2011; Zbl 1277.94006) Full Text: Link
Cui, Tingting; Hochbaum, Dorit S. Complexity of some inverse shortest path lengths problems. (English) Zbl 1208.05141 Networks 56, No. 1, 20-29 (2010). MSC: 05C85 05C38 05C35 68Q25 PDFBibTeX XMLCite \textit{T. Cui} and \textit{D. S. Hochbaum}, Networks 56, No. 1, 20--29 (2010; Zbl 1208.05141) Full Text: DOI
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B. Solving the convex cost integer dual network flow problem. (English) Zbl 1232.90317 Manage. Sci. 49, No. 7, 950-964 (2003). MSC: 90C25 90B10 90C10 90C31 PDFBibTeX XMLCite \textit{R. K. Ahuja} et al., Manage. Sci. 49, No. 7, 950--964 (2003; Zbl 1232.90317) Full Text: DOI
Hochbaum, Dorit S. Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. (English) Zbl 1001.90050 Eur. J. Oper. Res. 140, No. 2, 291-321 (2002). MSC: 90C10 90C08 90C35 PDFBibTeX XMLCite \textit{D. S. Hochbaum}, Eur. J. Oper. Res. 140, No. 2, 291--321 (2002; Zbl 1001.90050) Full Text: DOI
Hochbaum, Dorit S. A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (English) Zbl 1044.90083 Networks 37, No. 4, 171-193 (2001). Reviewer: Roman Čada (Plzeň) MSC: 90C35 68R10 05C85 PDFBibTeX XMLCite \textit{D. S. Hochbaum}, Networks 37, No. 4, 171--193 (2001; Zbl 1044.90083) Full Text: DOI
Hochbaum, Dorit S.; Woeginger, Gerhard J. A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. (English) Zbl 0956.90019 Oper. Res. Lett. 24, No. 1-2, 25-28 (1999). MSC: 90C08 90B06 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{G. J. Woeginger}, Oper. Res. Lett. 24, No. 1--2, 25--28 (1999; Zbl 0956.90019) Full Text: DOI
Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B. Solving the convex cost integer dual network flow problem. (English) Zbl 0948.90116 Cornuéjols, Gérard (ed.) et al., Integer programming and combinatorial optimization. 7th international IPCO conference, Graz, Austria, June 9-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1610, 31-44 (1999). MSC: 90C25 90B10 PDFBibTeX XMLCite \textit{R. K. Ahuja} et al., Lect. Notes Comput. Sci. 1610, 31--44 (1999; Zbl 0948.90116)
Hochbaum, Dorit S.; Pathria, Anu Analysis of the greedy approach in problems of maximum \(k\)-coverage. (English) Zbl 0938.90026 Nav. Res. Logist. 45, No. 6, 615-627 (1998). MSC: 90B35 05C90 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{A. Pathria}, Nav. Res. Logist. 45, No. 6, 615--627 (1998; Zbl 0938.90026) Full Text: DOI
Hochbaum, Dorit S.; Hong, Sung-Pil On the complexity of the production-transportation problem. (English) Zbl 0845.90087 SIAM J. Optim. 6, No. 1, 250-264 (1996). MSC: 90C08 90B30 68Q25 90B10 90C26 90C60 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{S.-P. Hong}, SIAM J. Optim. 6, No. 1, 250--264 (1996; Zbl 0845.90087) Full Text: DOI Link
Hochbaum, Dorit S.; Naor, Joseph Simple and fast algorithms for linear and integer programs with two variables per inequality. (English) Zbl 0831.90089 SIAM J. Comput. 23, No. 6, 1179-1192 (1994). Reviewer: D.Marinescu (Braşov) MSC: 90C10 05C85 90C05 68Q25 90C27 90C60 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{J. Naor}, SIAM J. Comput. 23, No. 6, 1179--1192 (1994; Zbl 0831.90089) Full Text: DOI
Goldschmidt, Olivier; Hochbaum, Dorit S.; Yu, Gang A modified greedy heuristic for the set covering problem with improved worst case bound. (English) Zbl 0811.68099 Inf. Process. Lett. 48, No. 6, 305-310 (1993). MSC: 68R05 68Q25 PDFBibTeX XMLCite \textit{O. Goldschmidt} et al., Inf. Process. Lett. 48, No. 6, 305--310 (1993; Zbl 0811.68099) Full Text: DOI
Hochbaum, Dorit S.; Seshadri, Sridhar The empirical performance of a polynomial algorithm for constrained nonlinear optimization. (English) Zbl 0786.90066 Ann. Oper. Res. 43, No. 1-4, 229-248 (1993). MSC: 90C30 90-08 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{S. Seshadri}, Ann. Oper. Res. 43, No. 1--4, 229--248 (1993; Zbl 0786.90066) Full Text: DOI
Hochbaum, Dorit S.; Shamir, Ron; Shanthikumar, J. George A polynomial algorithm for an integer quadratic non-separable transportation problem. (English) Zbl 0761.90061 Math. Program., Ser. A 55, No. 3, 359-371 (1992). Reviewer: J.Mitev (Sofia) MSC: 90B35 90C60 90C10 90C20 90C08 PDFBibTeX XMLCite \textit{D. S. Hochbaum} et al., Math. Program. 55, No. 3 (A), 359--371 (1992; Zbl 0761.90061) Full Text: DOI
Hochbaum, Dorit S. An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs. (English) Zbl 0769.90033 Oper. Res. 40, No. 5, 923-935 (1992). MSC: 90B15 90B18 65Y05 90-08 PDFBibTeX XMLCite \textit{D. S. Hochbaum}, Oper. Res. 40, No. 5, 923--935 (1992; Zbl 0769.90033) Full Text: DOI
Hochbaum, Dorit S.; Shamir, Ron Strongly polynomial algorithms for the high multiplicity scheduling problem. (English) Zbl 0736.90043 Oper. Res. 39, No. 4, 648-653 (1991). MSC: 90B35 90C60 90-08 90C08 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{R. Shamir}, Oper. Res. 39, No. 4, 648--653 (1991; Zbl 0736.90043) Full Text: DOI
Goldschmidt, Olivier; Hochbaum, Dorit S. Asymptotically optimal linear algorithm for the minimum \(k\)-cut in a random graph. (English) Zbl 0745.05046 SIAM J. Discrete Math. 3, No. 1, 58-73 (1990). MSC: 05C80 68R10 05C35 PDFBibTeX XMLCite \textit{O. Goldschmidt} and \textit{D. S. Hochbaum}, SIAM J. Discrete Math. 3, No. 1, 58--73 (1990; Zbl 0745.05046) Full Text: DOI
Goldschmidt, Oliver; Hochbaum, Dorit S. A fast perfect-matching algorithm in random graphs. (English) Zbl 0733.05072 SIAM J. Discrete Math. 3, No. 1, 48-57 (1990). Reviewer: O.Frank MSC: 05C80 05C70 PDFBibTeX XMLCite \textit{O. Goldschmidt} and \textit{D. S. Hochbaum}, SIAM J. Discrete Math. 3, No. 1, 48--57 (1990; Zbl 0733.05072) Full Text: DOI
Hochbaum, Dorit S.; Shanthikumar, J. George Convex separable optimization is not much harder than linear optimization. (English) Zbl 0721.90060 J. Assoc. Comput. Mach. 37, No. 4, 843-862 (1990). Reviewer: D.S.Hochbaum MSC: 90C25 90C10 90C60 90C35 90C30 90-08 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{J. G. Shanthikumar}, J. Assoc. Comput. Mach. 37, No. 4, 843--862 (1990; Zbl 0721.90060) Full Text: DOI
Alon, Noga; Cosares, Steven; Hochbaum, Dorit S.; Shamir, Ron An algorithm for the detection and construction of Monge sequences. (English) Zbl 0666.65044 Linear Algebra Appl. 114-115, 669-680 (1989). Reviewer: J.Rohn MSC: 65K05 90C08 PDFBibTeX XMLCite \textit{N. Alon} et al., Linear Algebra Appl. 114--115, 669--680 (1989; Zbl 0666.65044) Full Text: DOI
Hochbaum, Dorit S.; Shmoys, David B. A best possible parallel approximation algorithm for a graph theoretic problem. (English) Zbl 0664.90088 Operational Research, Proc. 11th IFORS int. Conf., Buenos Aires 1987, 933-938 (1988). MSC: 90C35 65K05 PDFBibTeX XML
Hall, Nicholas G.; Hochbaum, Dorit S. A fast approximation algorithm for the multicovering problem. (English) Zbl 0602.90110 Discrete Appl. Math. 15, 35-40 (1986). Reviewer: A.P.Bosznay MSC: 90C27 90C10 68Q25 90C09 PDFBibTeX XMLCite \textit{N. G. Hall} and \textit{D. S. Hochbaum}, Discrete Appl. Math. 15, 35--40 (1986; Zbl 0602.90110) Full Text: DOI
Hochbaum, Dorit S.; Wigderson, Edna The linzertorte problem, or a unified approach to painting, baking and weaving. (English) Zbl 0602.05029 Discrete Appl. Math. 14, 17-32 (1986). Reviewer: J.Fiamčík MSC: 05C15 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{E. Wigderson}, Discrete Appl. Math. 14, 17--32 (1986; Zbl 0602.05029) Full Text: DOI
Hochbaum, Dorit S.; Nishizeki, Takao; Shmoys, David B. A better than ”best possible” algorithm to edge color multigraphs. (English) Zbl 0594.68041 J. Algorithms 7, 79-104 (1986). MSC: 68Q25 05C15 PDFBibTeX XMLCite \textit{D. S. Hochbaum} et al., J. Algorithms 7, 79--104 (1986; Zbl 0594.68041) Full Text: DOI
Hochbaum, Dorit S.; Shmoys, David B. A packing problem you can almost solve by sitting on your suitcase. (English) Zbl 0589.90042 SIAM J. Algebraic Discrete Methods 7, 247-257 (1986). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{D. B. Shmoys}, SIAM J. Algebraic Discrete Methods 7, 247--257 (1986; Zbl 0589.90042) Full Text: DOI
Hochbaum, Dorit S.; Shmoys, David B. An \(O(| V| ^ 2)\) algorithm for the planar 3-cut problem. (English) Zbl 0572.05040 SIAM J. Algebraic Discrete Methods 6, 707-712 (1985). Reviewer: S.Stahl MSC: 05C40 05C10 68R10 05C35 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{D. B. Shmoys}, SIAM J. Algebraic Discrete Methods 6, 707--712 (1985; Zbl 0572.05040) Full Text: DOI
Hochbaum, Dorit S.; Shmoys, David B. A best possible heuristic for the k-center problem. (English) Zbl 0565.90015 Math. Oper. Res. 10, 180-184 (1985). MSC: 90B05 68Q25 05C35 65K05 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{D. B. Shmoys}, Math. Oper. Res. 10, 180--184 (1985; Zbl 0565.90015) Full Text: DOI
Hochbaum, Dorit S.; Maass, Wolfgang Approximation schemes for covering and packing problems in robotics and VLSI. (English) Zbl 0557.68035 Theoretical aspects of computer science, Symp., Paris 1984, Lect. Notes Comput. Sci. 166, 55-62 (1984). Reviewer: M.Křivánek MSC: 68Q25 05B40 PDFBibTeX XML
Hochbaum, Dorit; Steele, J. Michael Steinhaus’s geometric location problem for random samples in the plane. (English) Zbl 0501.60040 Adv. Appl. Probab. 14, 56-67 (1982). MSC: 60F15 PDFBibTeX XMLCite \textit{D. Hochbaum} and \textit{J. M. Steele}, Adv. Appl. Probab. 14, 56--67 (1982; Zbl 0501.60040) Full Text: DOI