| Year |
Citation |
Score |
| 2020 |
Hochbaum DS, Lu C. A FASTER ALGORITHM SOLVING A GENERALIZATION OF ISOTONIC MEDIAN REGRESSION AND A CLASS OF FUSED LASSO PROBLEMS (vol 27, pg 2563, 2017) Siam Journal On Optimization. 30: 1048-1048. DOI: 10.1137/18M1175495 |
0.551 |
|
| 2020 |
Hochbaum DS, Rao X. Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer Information Processing Letters. 158: 105940. DOI: 10.1016/J.Ipl.2020.105940 |
0.55 |
|
| 2020 |
Velednitsky M, Hochbaum DS. Isolation branching: a branch and bound algorithm for the k-terminal cut problem Journal of Combinatorial Optimization. 1-21. DOI: 10.1007/S10878-020-00534-Y |
0.551 |
|
| 2020 |
Achá RJA, Hochbaum DS, Spaen Q. HNCcorr: combinatorial optimization for neuron identification Annals of Operations Research. 289: 5-32. DOI: 10.1007/S10479-019-03464-Z |
0.463 |
|
| 2020 |
Chang M, Hochbaum DS, Spaen Q, Velednitsky M. An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals Theory of Computing Systems \/ Mathematical Systems Theory. 64: 645-661. DOI: 10.1007/S00224-019-09947-7 |
0.392 |
|
| 2019 |
Sarto Basso R, Hochbaum DS, Vandin F. Efficient algorithms to discover alterations with complementary functional association in cancer. Plos Computational Biology. 15: e1006802. PMID 31120875 DOI: 10.1371/Journal.Pcbi.1006802 |
0.399 |
|
| 2019 |
Spaen Q, Asín-Achá R, Chettih SN, Minderer M, Harvey C, Hochbaum DS. HNCcorr: A Novel Combinatorial Approach for Cell Identification in Calcium-Imaging Movies. Eneuro. 6. PMID 31058211 DOI: 10.1523/Eneuro.0304-18.2019 |
0.369 |
|
| 2019 |
Hochbaum DS, Rao X. The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem Operations Research. 67: 1345-1361. DOI: 10.1287/Opre.2018.1839 |
0.514 |
|
| 2019 |
Baumann P, Hochbaum DS, Yang YT. A comparative study of the leading machine learning techniques and two new optimization algorithms European Journal of Operational Research. 272: 1041-1057. DOI: 10.1016/J.Ejor.2018.07.009 |
0.377 |
|
| 2019 |
Hochbaum DS. Algorithms and complexity of range clustering Networks. 73: 170-186. DOI: 10.1002/Net.21854 |
0.318 |
|
| 2018 |
Hochbaum DS. Complexity and approximations for submodular minimization problems on two variables per inequality constraints Discrete Applied Mathematics. 250: 252-261. DOI: 10.1016/J.Dam.2018.04.012 |
0.566 |
|
| 2018 |
Hochbaum DS, Levin A. Weighted matching with pair restrictions Optimization Letters. 12: 649-659. DOI: 10.1007/S11590-017-1217-7 |
0.561 |
|
| 2017 |
Hochbaum DS, Lu C. A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems Siam Journal On Optimization. 27: 2563-2596. DOI: 10.1137/15M1024081 |
0.452 |
|
| 2016 |
Baumann P, Cooper RJ, Hochbaum DS, Patel N, Shalia K. Efficient deployment of mobile detectors for security applications Ieee International Conference On Industrial Engineering and Engineering Management. 2016: 214-218. DOI: 10.1109/IEEM.2015.7385639 |
0.38 |
|
| 2016 |
Hochbaum DS. A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem Computers and Industrial Engineering. 95: 64-71. DOI: 10.1016/J.Cie.2016.02.018 |
0.507 |
|
| 2016 |
Fishbain B, Hochbaum DS, Mueller S. A competitive study of the pseudoflow algorithm for the minimum s–t cut problem in vision applications Journal of Real-Time Image Processing. 11: 589-609. DOI: 10.1007/S11554-013-0344-3 |
0.56 |
|
| 2015 |
Hochbaum DS, Wagner MR. Production cost functions and demand uncertainty effects in price-only contracts Iie Transactions (Institute of Industrial Engineers). 47: 190-202. DOI: 10.1080/0740817X.2014.938843 |
0.307 |
|
| 2014 |
Yang YT, Fishbain B, Hochbaum DS, Norman EB, Swanberg E. The supervised normalized cut method for detecting, classifying, and identifying special nuclear materials Informs Journal On Computing. 26: 45-58. DOI: 10.1287/Ijoc.1120.0546 |
0.313 |
|
| 2014 |
Hochbaum DS, Baumann P. Sparse computation for large-scale data mining Proceedings - 2014 Ieee International Conference On Big Data, Ieee Big Data 2014. 354-363. DOI: 10.1109/Tbdata.2016.2576470 |
0.376 |
|
| 2014 |
Hochbaum DS, Lyu C, Ordóñez F. Security routing games with multivehicle Chinese postman problem Networks. 64: 181-191. DOI: 10.1002/Net.21563 |
0.446 |
|
| 2013 |
Hochbaum DS. A polynomial time algorithm for Rayleigh ratio on discrete variables: Replacing spectral techniques for expander ratio, normalized cut, and cheeger constant Operations Research. 61: 184-198. DOI: 10.1287/Opre.1120.1126 |
0.599 |
|
| 2013 |
Hochbaum DS, Levin A. Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems Acm Transactions On Algorithms. 9. DOI: 10.1145/2438645.2438651 |
0.577 |
|
| 2013 |
Fishbain B, Hochbaum DS, Yang YT. Real-time robust target tracking in videos via graph-cuts Proceedings of Spie - the International Society For Optical Engineering. 8656. DOI: 10.1117/12.2002947 |
0.374 |
|
| 2013 |
Hochbaum DS. Multi-label Markov Random Fields as an efficient and effective tool for image segmentation, total variations and regularization Numerical Mathematics. 6: 169-198. DOI: 10.1017/S1004897900001185 |
0.462 |
|
| 2013 |
Hochbaum DS, Orlin JB. Simplifications and speedups of the pseudoflow algorithm Networks. 61: 40-57. DOI: 10.1002/Net.21467 |
0.472 |
|
| 2012 |
Hochbaum DS, Hsu CN, Yang YT. Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores. Bioinformatics (Oxford, England). 28: i106-14. PMID 22689749 DOI: 10.1093/Bioinformatics/Bts232 |
0.362 |
|
| 2012 |
Hochbaum DS. An efficient and effective tool for image segmentation, total variations and regularization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6667: 338-349. DOI: 10.1007/978-3-642-24785-9_29 |
0.353 |
|
| 2011 |
Baghaie M, Hochbaum DS, Krishnamachari B. On hardness of multiflow transmission in delay constrained cooperative wireless networks Globecom - Ieee Global Telecommunications Conference. DOI: 10.1109/GLOCOM.2011.6134487 |
0.442 |
|
| 2011 |
Hochbaum DS, Fishbain B. Nuclear threat detection with mobile distributed sensor networks Annals of Operations Research. 187: 45-63. DOI: 10.1007/S10479-009-0643-Z |
0.374 |
|
| 2010 |
Hochbaum DS. Polynomial time algorithms for ratio regions and a variant of normalized cut. Ieee Transactions On Pattern Analysis and Machine Intelligence. 32: 889-98. PMID 20299712 DOI: 10.1109/Tpami.2009.80 |
0.596 |
|
| 2010 |
Hochbaum DS, Levin A. Covering the edges of bipartite graphs using K2, 2 graphs Theoretical Computer Science. 411: 1-9. DOI: 10.1016/J.Tcs.2009.08.018 |
0.48 |
|
| 2010 |
Hochbaum DS, Levin A. How to allocate review tasks for robust ranking Acta Informatica. 47: 325-345. DOI: 10.1007/S00236-010-0120-9 |
0.403 |
|
| 2010 |
Cui T, Hochbaum DS. Complexity of some inverse shortest path lengths problems Networks. 56: 20-29. DOI: 10.1002/Net.V56:1 |
0.483 |
|
| 2009 |
Chandran BG, Hochbaum DS. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem Operations Research. 57: 358-376. DOI: 10.1287/Opre.1080.0572 |
0.532 |
|
| 2009 |
Hochbaum DS, Singh V. An efficient algorithm for Co-segmentation Proceedings of the Ieee International Conference On Computer Vision. 269-276. DOI: 10.1109/ICCV.2009.5459261 |
0.355 |
|
| 2009 |
Hochbaum DS. Dynamic evolution of economically preferred facilities European Journal of Operational Research. 193: 649-659. DOI: 10.1016/J.Ejor.2007.07.027 |
0.424 |
|
| 2009 |
Hochbaum DS. The multi-sensor nuclear threat detection problem Operations Research/ Computer Science Interfaces Series. 47: 389-399. DOI: 10.1007/978-0-387-88843-9_20 |
0.311 |
|
| 2009 |
Hochbaum DS, Levin A. The multi-integer set cover and the facility terminal cover problem Networks. 53: 63-66. DOI: 10.1002/Net.V53:1 |
0.573 |
|
| 2008 |
Hochbaum DS. The pseudoflow algorithm: A new algorithm for the maximum-flow problem Operations Research. 56: 992-1009. DOI: 10.1287/Opre.1080.0524 |
0.547 |
|
| 2008 |
Ahuja RK, Hochbaum DS. Solving linear cost dynamic lot-sizing problems in O(n log n) time Operations Research. 56: 255-261. DOI: 10.1287/Opre.1070.0508 |
0.497 |
|
| 2008 |
Hochbaum DS, Moreno-Centeno E. The inequality-satisfiability problem Operations Research Letters. 36: 229-233. DOI: 10.1016/J.Orl.2007.05.005 |
0.511 |
|
| 2008 |
Hochbaum DS, Levin A. Covering the edges of bipartite graphs using K2,2 graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4927: 116-127. DOI: 10.1007/978-3-540-77918-6_10 |
0.411 |
|
| 2007 |
Hochbaum DS. Complexity and algorithms for nonlinear optimization problems Annals of Operations Research. 153: 257-296. DOI: 10.1007/S10479-007-0172-6 |
0.568 |
|
| 2007 |
Hochbaum DS, Levin A. The k-allocation problem and its variants Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4368: 253-264. |
0.309 |
|
| 2006 |
Hochbaum DS, Levin A. Methodologies and algorithms for group-rankings decision Management Science. 52: 1394-1408. DOI: 10.1287/Mnsc.1060.0540 |
0.319 |
|
| 2006 |
Hochbaum DS, Levin A. Optimizing over consecutive 1's and circular 1's constraints Siam Journal On Optimization. 17: 311-330. DOI: 10.1137/040603048 |
0.567 |
|
| 2006 |
Hochbaum DS, Levin A. Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms Discrete Optimization. 3: 327-340. DOI: 10.1016/J.Disopt.2006.02.002 |
0.575 |
|
| 2006 |
Hochbaum DS. Ranking sports teams and the inverse equal paths problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4286: 307-318. DOI: 10.1007/11944874_28 |
0.403 |
|
| 2005 |
Hochbaum DS. Complexity and algorithms for convex network optimization and other nonlinear problems 4or. 3: 171-216. DOI: 10.1007/S10288-005-0078-6 |
0.57 |
|
| 2004 |
Hochbaum DS. Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today Management Science. 50: 709-723. DOI: 10.1287/Mnsc.1040.0242 |
0.557 |
|
| 2004 |
Hochbaum DS. Monotonizing linear programs with up to two nonzeroes per column Operations Research Letters. 32: 49-58. DOI: 10.1016/S0167-6377(03)00074-9 |
0.511 |
|
| 2004 |
Ahuja RK, Hochbaum DS, Orlin JB. A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem Algorithmica (New York). 39: 189-208. DOI: 10.1007/S00453-004-1085-2 |
0.586 |
|
| 2003 |
Hochbaum DS. Efficient algorithms for the inverse spanning-tree problem Operations Research. 51. DOI: 10.1287/Opre.51.5.785.16756 |
0.513 |
|
| 2003 |
Goldschmidt O, Hochbaum DS, Levin A, Olinick EV. The SONET Edge-Partition Problem Networks. 41: 13-23. DOI: 10.1002/Net.10054 |
0.767 |
|
| 2002 |
Adler I, Erera AL, Hochbaum DS, Olinick EV. Baseball, optimization, and the World Wide Web Interfaces. 32: 12-22. DOI: 10.1287/Inte.32.2.12.67 |
0.707 |
|
| 2002 |
Hochbaum DS. Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations European Journal of Operational Research. 140: 291-321. DOI: 10.1016/S0377-2217(02)00071-1 |
0.58 |
|
| 2002 |
Hochbaum DS, Tucker PA. Minimax Problems with Bitonic Matrices Networks. 40: 113-124. DOI: 10.1002/Net.10038 |
0.535 |
|
| 2001 |
Atamtürk A, Hochbaum DS. Capacity acquisition, subcontracting, and lot sizing Management Science. 47: 1081-1100. DOI: 10.1287/Mnsc.47.8.1081.10232 |
0.349 |
|
| 2001 |
Hochbaum DS, Olinick EV. The Bounded Cycle-Cover Problem Informs Journal On Computing. 13: 104-119. DOI: 10.1287/Ijoc.13.2.104.10516 |
0.783 |
|
| 2001 |
Hochbaum DS. An efficient algorithm for image segmentation, Markov random fields and related problems Journal of the Acm. 48: 686-701. DOI: 10.1145/502090.502093 |
0.541 |
|
| 2001 |
Hochbaum DS. A new-old algorithm for minimum-cut and maximum-flow in closure graphs Networks. 37: 171-193. DOI: 10.1002/Net.1012 |
0.555 |
|
| 2000 |
Hochbaum DS, Chen A. Performance analysis and best implementations of old and new algorithms for the open-pit mining problem Operations Research. 48: 894-914. DOI: 10.1287/Opre.48.6.894.12392 |
0.557 |
|
| 2000 |
Hochbaum DS, Queyranne M. Minimizing a convex cost closure set Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1879: 256-267. DOI: 10.1137/S0895480100369584 |
0.544 |
|
| 2000 |
Hochbaum DS, Pathria A. Approximating a generalization of MAX 2SAT and MIN 2SAT Discrete Applied Mathematics. 107: 41-59. DOI: 10.1016/S0166-218X(00)00244-4 |
0.587 |
|
| 2000 |
Hochbaum DS. Instant recognition of polynomial time solvability, half integrality, and 2-approximations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1913: 2-12. DOI: 10.1007/3-540-44436-X_2 |
0.551 |
|
| 1999 |
Ahuja RK, Hochbaum DS, Orlin JB. Solving the convex cost integer dual network flow problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1610: 31-44. DOI: 10.1287/Mnsc.49.7.950.16384 |
0.512 |
|
| 1999 |
Chudak FA, Hochbaum DS. Half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine Operations Research Letters. 25: 199-204. DOI: 10.1016/S0167-6377(99)00056-5 |
0.486 |
|
| 1999 |
Hochbaum DS, Woeginger GJ. Linear-time algorithm for the bottleneck transportation problem with a fixed number of sources Operations Research Letters. 24: 25-28. DOI: 10.1016/S0167-6377(98)00053-4 |
0.509 |
|
| 1998 |
Hochbaum DS, Pathria A. Locating centers in a dynamically changing network, and related problems Location Science. 6: 243-256. DOI: 10.1016/S0966-8349(98)00048-5 |
0.468 |
|
| 1998 |
Chudak FA, Goemans MX, Hochbaum DS, Williamson DP. A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs Operations Research Letters. 22: 111-118. DOI: 10.1016/S0167-6377(98)00021-2 |
0.566 |
|
| 1998 |
Hochbaum DS. The t- vertex cover problem: Extending the half integrality framework with budget constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1444: 111-122. DOI: 10.1007/Bfb0053968 |
0.563 |
|
| 1998 |
Hochbaum DS. Instant recognition of half integrality and 2-approximations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1444: 99-110. DOI: 10.1007/Bfb0053967 |
0.498 |
|
| 1998 |
Hochbaum DS. The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1412: 325-337. DOI: 10.1007/3-540-69346-7_25 |
0.47 |
|
| 1998 |
Hochbaum DS. Approximating Clique and Biclique Problems Journal of Algorithms. 29: 174-200. DOI: 10.1006/Jagm.1998.0964 |
0.593 |
|
| 1998 |
Hochbaum DS, Pathria A. Analysis of the greedy approach in problems of maximum k-coverage Naval Research Logistics. 45: 615-627. DOI: 10.1002/(Sici)1520-6750(199809)45:6<615::Aid-Nav5>3.0.Co;2-5 |
0.497 |
|
| 1997 |
Hochbaum DS. Path costs in evolutionary tree reconstruction Journal of Computational Biology. 4: 163-175. PMID 9228615 DOI: 10.1089/Cmb.1997.4.163 |
0.482 |
|
| 1997 |
Hochbaum DS, Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime Operations Research. 45: 874-885. DOI: 10.1287/Opre.45.6.874 |
0.534 |
|
| 1997 |
Adams JB, Hochbaum DS. A new and fast approach to very large scale integrated sequential circuit test generation Operations Research. 45: 842-856. DOI: 10.1287/Opre.45.6.842 |
0.379 |
|
| 1997 |
Hochbaum DS, Pathria A. Forest harvesting and minimum cuts: A new approach to handling spatial constraints Forest Science. 43: 544-554. DOI: 10.1093/Forestscience/43.4.544 |
0.515 |
|
| 1997 |
Hochbaum DS, Pathria A. Generalized p-center problems: Complexity results and approximation algorithms European Journal of Operational Research. 100: 594-607. DOI: 10.1016/S0377-2217(96)00076-8 |
0.536 |
|
| 1997 |
Hochbaum DS, Landy D. Scheduling with batching: Two job types Discrete Applied Mathematics. 72: 99-114. DOI: 10.1016/S0166-218X(96)00039-X |
0.452 |
|
| 1997 |
Goldschmidt O, Hochbaum DS. k-edge subgraph problems Discrete Applied Mathematics. 74: 159-169. DOI: 10.1016/S0166-218X(96)00030-3 |
0.554 |
|
| 1997 |
Garg N, Hochbaum DS. An O(log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane Algorithmica (New York). 18: 111-121. DOI: 10.1007/Bf02523691 |
0.502 |
|
| 1996 |
Goldschmidt O, Hochbaum DS, Hurkens C, Yu G. Approximation algorithms for the k-clique covering problem Siam Journal On Discrete Mathematics. 9: 492-509. DOI: 10.1137/S089548019325232X |
0.601 |
|
| 1996 |
Hochbaum DS, Hong SP. On the complexity of the production-transportation problem Siam Journal On Optimization. 6: 250-264. DOI: 10.1137/0806014 |
0.466 |
|
| 1996 |
Hochbaum DS. An optimal test compression procedure for combinational circuits Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 15: 1294-1299. DOI: 10.1109/43.541449 |
0.359 |
|
| 1996 |
Hochbaum DS, Naor J. Approximation Algorithms for Network Design Problems on Bounded Subsets Journal of Algorithms. 21: 403-414. DOI: 10.1006/Jagm.1996.0050 |
0.552 |
|
| 1996 |
Hochbaum DS, Pathria A. The bottleneck graph partition problem Networks. 28: 221-225. DOI: 10.1002/(Sici)1097-0037(199612)28:4<221::Aid-Net6>3.0.Co;2-N |
0.525 |
|
| 1995 |
Hochbaum DS. A nonlinear Knapsack problem Operations Research Letters. 17: 103-110. DOI: 10.1016/0167-6377(95)00009-9 |
0.494 |
|
| 1995 |
Hochbaum DS, Hong SP. About strongly polynomial time algorithms for quadratic optimization over submodular constraints Mathematical Programming. 69: 269-309. DOI: 10.1007/Bf01585561 |
0.554 |
|
| 1994 |
Hochbaum DS. Lower and upper bounds for the allocation problem and other nonlinear optimization problems Mathematics of Operations Research. 19: 390-409. DOI: 10.1287/Moor.19.2.390 |
0.595 |
|
| 1994 |
Cosares S, Hochbaum DS. Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources Mathematics of Operations Research. 19: 94-111. DOI: 10.1287/Moor.19.1.94 |
0.561 |
|
| 1994 |
Goldschmidt O, Hochbaum DS. A Polynomial Algorithm for the k-cut Problem for Fixed k Mathematics of Operations Research. 19: 24-37. DOI: 10.1287/Moor.19.1.24 |
0.442 |
|
| 1994 |
Hochbaum DS. Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality Siam Journal On Computing. 23: 1179-1192. DOI: 10.1137/S0097539793251876 |
0.531 |
|
| 1994 |
Hochbaum DS, Landy D. Scheduling with batching: minimizing the weighted number of tardy jobs Operations Research Letters. 16: 79-86. DOI: 10.1016/0167-6377(94)90063-9 |
0.481 |
|
| 1993 |
Hochbaum DS. Why should biconnected components be identified first Discrete Applied Mathematics. 42: 203-210. DOI: 10.1016/0166-218X(93)90046-Q |
0.519 |
|
| 1993 |
Goldschmidt O, Hochbaum DS, Yu G. A modified greedy heuristic for the Set Covering problem with improved worst case bound Information Processing Letters. 48: 305-310. DOI: 10.1016/0020-0190(93)90173-7 |
0.485 |
|
| 1993 |
Hochbaum DS, Seshadri S. The empirical performance of a polynomial algorithm for constrained nonlinear optimization Annals of Operations Research. 43: 229-248. DOI: 10.1007/Bf02025453 |
0.509 |
|
| 1993 |
Hochbaum DS, Megiddo N, Naor J(, Tamir A. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality Mathematical Programming. 62: 69-83. DOI: 10.1007/Bf01585160 |
0.57 |
|
| 1992 |
Hochbaum DS. An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs Operations Research. 40: 923-935. DOI: 10.1287/Opre.40.5.923 |
0.543 |
|
| 1992 |
Hall NG, Hochbaum DS. The multicovering problem European Journal of Operational Research. 62: 323-339. DOI: 10.1016/0377-2217(92)90122-P |
0.579 |
|
| 1992 |
Hochbaum DS, Shamir R, Shanthikumar JG. A polynomial algorithm for an integer quadratic non-separable transportation problem Mathematical Programming. 55: 359-371. DOI: 10.1007/Bf01581207 |
0.599 |
|
| 1991 |
Hochbaum DS, Shamir R. Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem Operations Research. 39: 648-653. DOI: 10.1287/Opre.39.4.648 |
0.559 |
|
| 1990 |
Hochbaum DS, Shanthikumar JG. Convex Separable Optimization is Not Much Harder than Linear Optimization Journal of the Acm (Jacm). 37: 843-862. DOI: 10.1145/96559.96597 |
0.559 |
|
| 1990 |
Goldschmidt O, Hochbaum DS. Asymptotically optimal linear algorithm for the minimal k -cut in a random graph Siam Journal On Discrete Mathematics. 3: 58-73. DOI: 10.1137/0403007 |
0.406 |
|
| 1990 |
Goldschmidt O, Hochbaum DS. A fast perfect-matching algorithm in random graphs Siam Journal On Discrete Mathematics. 3: 48-57. DOI: 10.1137/0403006 |
0.449 |
|
| 1990 |
Hochbaum DS, Shamir R. Minimizing the number of tardy job units under release time constraints Discrete Applied Mathematics. 28: 45-57. DOI: 10.1016/0166-218X(90)90093-R |
0.538 |
|
| 1989 |
Alon N, Cosares S, Hochbaum DS, Shamir R. An algorithm for the detection and construction of Monge sequences Linear Algebra and Its Applications. 114: 669-680. DOI: 10.1016/0024-3795(89)90487-4 |
0.543 |
|
| 1989 |
Hochbaum DS, Shamir R. An O(nlog2n) algorithm for the maximum weigthed tardiness problem Information Processing Letters. 31: 215-219. DOI: 10.1016/0020-0190(89)90126-9 |
0.518 |
|
| 1989 |
Hochbaum DS, Segev A. Analysis of a flow problem with fixed charges Networks. 19: 291-312. DOI: 10.1002/Net.3230190304 |
0.452 |
|
| 1988 |
Hochbaum Ds, Shmoys DB. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach Siam Journal On Computing. 17: 539-551. DOI: 10.1137/0217033 |
0.525 |
|
| 1987 |
Hochbaum DS, Shmoys DB. Using dual approximation algorithms for scheduling problems theoretical and practical results Journal of the Acm (Jacm). 34: 144-162. DOI: 10.1145/7531.7535 |
0.576 |
|
| 1987 |
Hochbaum DS, Maass W. Fast approximation algorithms for a nonconvex covering problem Journal of Algorithms. 8: 305-323. DOI: 10.1016/0196-6774(87)90012-5 |
0.508 |
|
| 1986 |
Hochbaum DS, Shmoys DB. A unified approach to approximation algorithms for bottleneck problems Journal of the Acm (Jacm). 33: 533-550. DOI: 10.1145/5925.5933 |
0.557 |
|
| 1986 |
Hochbaum DS, Shmoys DB. A packing problem you can almost solve by sitting on your suitcase Siam Journal On Algebraic and Discrete Methods. 7: 247-257. DOI: 10.1137/0607028 |
0.593 |
|
| 1986 |
Hochbaum DS, Shmoys DB. Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem European Journal of Operational Research. 26: 380-384. DOI: 10.1016/0377-2217(86)90140-2 |
0.53 |
|
| 1986 |
Hochbaum DS, Nishizeki T, Shmoys DB. A better than "best possible" algorithm to edge color multigraphs Journal of Algorithms. 7: 79-104. DOI: 10.1016/0196-6774(86)90039-8 |
0.432 |
|
| 1986 |
Hall NG, Hochbaum DS. A fast approximation algorithm for the multicovering problem Discrete Applied Mathematics. 15: 35-40. DOI: 10.1016/0166-218X(86)90016-8 |
0.546 |
|
| 1986 |
Hochbaum DS, Wigderson E. The Linzertorte problem, or a unified approach to painting, baking and weaving Discrete Applied Mathematics. 14: 17-32. DOI: 10.1016/0166-218X(86)90004-1 |
0.481 |
|
| 1985 |
Hochbaum DS, Shmoys DB. A Best Possible Heuristic for the k-Center Problem Mathematics of Operations Research. 10: 180-184. DOI: 10.1287/Moor.10.2.180 |
0.555 |
|
| 1985 |
Hochbaum DS, Maass W. Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI Journal of the Acm (Jacm). 32: 130-136. DOI: 10.1145/2455.214106 |
0.531 |
|
| 1985 |
Hochbaum DS, Shmoys DB. An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem Siam Journal On Algebraic and Discrete Methods. 6: 707-712. DOI: 10.1137/0606068 |
0.424 |
|
| 1985 |
Hochbaum DS. Easy Solutions for the K-Center Problem or the Dominating Set Problem on Random Graphs North-Holland Mathematics Studies. 109: 189-209. DOI: 10.1016/S0304-0208(08)73108-6 |
0.515 |
|
| 1984 |
Hochbaum DS. When are NP-hard location problems easy? Annals of Operations Research. 1: 201-214. DOI: 10.1007/Bf01874389 |
0.504 |
|
| 1983 |
Hochbaum DS. On the Fractional Solution to the Set Covering Problem Siam Journal On Algebraic and Discrete Methods. 4: 221-222. DOI: 10.1137/0604023 |
0.481 |
|
| 1983 |
Hochbaum DS. Efficient bounds for the stable set, vertex cover and set packing problems Discrete Applied Mathematics. 6: 243-254. DOI: 10.1016/0166-218X(83)90080-X |
0.526 |
|
| 1982 |
Hochbaum D, Steele JM. Steinhaus' Geometric Location Problem for Random Samples in the Plane. Advances in Applied Probability. 14: 56-67. DOI: 10.2307/1426733 |
0.566 |
|
| 1982 |
Hochbaum DS. Approximation Algorithms for the Set Covering and Vertex Cover Problems Siam Journal On Computing. 11: 555-556. DOI: 10.1137/0211045 |
0.536 |
|
| 1982 |
Hochbaum DS. Heuristics for the fixed cost median problem Mathematical Programming. 22: 148-162. DOI: 10.1007/Bf01581035 |
0.515 |
|
| 1980 |
Fisher ML, Hochbaum DS. Probabilistic Analysis of the Planar k-Median Problem Mathematics of Operations Research. 5: 27-34. DOI: 10.1287/Moor.5.1.27 |
0.402 |
|
| 1980 |
Fisher ML, Hochbaum DS. Database Location in Computer Networks Journal of the Acm (Jacm). 27: 718-735. DOI: 10.1145/322217.322226 |
0.57 |
|
| Show low-probability matches. |