Остановите войну!
for scientists:
default search action
Dorit S. Hochbaum
- > Home > Persons > Dorit S. Hochbaum
Publications
- 2023
- [j119]Anita Schöbel, David Pisinger, Dorit S. Hochbaum:
Obituary for Professor Emeritus Jakob Kraurp. Eur. J. Oper. Res. 310(1): 1-2 (2023) - [c36]Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt:
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. ACDA 2023: 189-200 - [i17]Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin:
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. CoRR abs/2307.15702 (2023) - [i16]Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá:
Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits. CoRR abs/2309.03924 (2023) - 2022
- [j118]Dorit S. Hochbaum, Xu Rao, Jason J. Sauppe:
Network flow methods for the minimum covariate imbalance problem. Eur. J. Oper. Res. 300(3): 827-836 (2022) - [j117]Mark Velednitsky, Dorit S. Hochbaum:
Isolation branching: a branch and bound algorithm for the k-terminal cut problem. J. Comb. Optim. 44(3): 1659-1679 (2022) - [c34]Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta:
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. KDIR 2022: 29-39 - [c33]Philipp Baumann, Dorit S. Hochbaum:
A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. ICPRAM 2022: 195-202 - [i15]Philipp Baumann, Dorit S. Hochbaum:
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. CoRR abs/2212.14437 (2022) - 2021
- [j113]Dorit S. Hochbaum, Asaf Levin, Xu Rao:
Complexity, algorithms and applications of the integer network flow with fractional supplies problem. Oper. Res. Lett. 49(4): 559-564 (2021) - 2020
- [j112]Roberto Javier Asín Achá, Dorit S. Hochbaum, Quico Spaen:
HNCcorr: combinatorial optimization for neuron identification. Ann. Oper. Res. 289(1): 5-32 (2020) - [j111]Dorit S. Hochbaum, Xu Rao:
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer. Inf. Process. Lett. 158: 105940 (2020) - [j110]Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Theory Comput. Syst. 64(4): 645-661 (2020) - [j109]Dorit S. Hochbaum, Xu Rao:
A fully polynomial time approximation scheme for the Replenishment Storage problem. Oper. Res. Lett. 48(6): 835-839 (2020) - [i12]Dorit S. Hochbaum, Xu Rao:
Network Flow Methods for the Minimum Covariates Imbalance Problem. CoRR abs/2007.06828 (2020) - [i11]Dorit S. Hochbaum, Asaf Levin, Xu Rao:
Algorithms and Complexity for Variants of Covariates Fine Balance. CoRR abs/2009.08172 (2020) - [i10]Dorit S. Hochbaum, Xu Rao:
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem. CoRR abs/2010.01631 (2020) - 2019
- [j107]Philipp Baumann, Dorit S. Hochbaum, Yan T. Yang:
A comparative study of the leading machine learning techniques and two new optimization algorithms. Eur. J. Oper. Res. 272(3): 1041-1057 (2019) - [j106]Dorit S. Hochbaum, Xu Rao:
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem. Oper. Res. 67(5): 1345-1361 (2019) - [c31]Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
Detecting Aberrant Linking Behavior in Directed Networks. KDIR 2019: 72-82 - 2018
- [j101]Dorit S. Hochbaum, Asaf Levin:
Weighted matching with pair restrictions. Optim. Lett. 12(3): 649-659 (2018) - [c30]Mark Velednitsky, Dorit S. Hochbaum:
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. COCOA 2018: 624-639 - [c28]Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. WAOA 2018: 149-164 - [i9]Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. CoRR abs/1805.02014 (2018) - 2017
- [c27]Philipp Baumann, Dorit S. Hochbaum, Quico Spaen:
High-performance geometric algorithms for sparse computation in big data analytics. IEEE BigData 2017: 546-555 - 2016
- [j98]Barak Fishbain, Dorit S. Hochbaum, Stefan Müller:
A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications. J. Real Time Image Process. 11(3): 589-609 (2016) - [j97]Dorit S. Hochbaum, Philipp Baumann:
Sparse Computation for Large-Scale Data Mining. IEEE Trans. Big Data 2(2): 151-174 (2016) - [c26]Philipp Baumann, Dorit S. Hochbaum, Quico Spaen:
Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. ICPRAM 2016: 224-231 - 2015
- [c25]Philipp Baumann, Reynold J. Cooper, Dorit S. Hochbaum, Nidhi Patel, Kunal Shalia:
Efficient deployment of mobile detectors for security applications. IEEM 2015: 214-218 - 2014
- [j95]Yan T. Yang, Barak Fishbain, Dorit S. Hochbaum, Eric B. Norman, Erik Swanberg:
The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials. INFORMS J. Comput. 26(1): 45-58 (2014) - [c24]Dorit S. Hochbaum, Philipp Baumann:
Sparse computation for large-scale data mining. IEEE BigData 2014: 354-363 - 2013
- [j91]Dorit S. Hochbaum, James B. Orlin:
Simplifications and speedups of the pseudoflow algorithm. Networks 61(1): 40-57 (2013) - [j90]Dorit S. Hochbaum, Asaf Levin:
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. ACM Trans. Algorithms 9(2): 19:1-19:12 (2013) - [c23]Barak Fishbain, Dorit S. Hochbaum, Yan T. Yang:
Real-time robust target tracking in videos via graph-cuts. Real-Time Image and Video Processing 2013: 865602 - 2012
- [j89]Dorit S. Hochbaum, Chun-Nan Hsu, Yan T. Yang:
Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores. Bioinform. 28(12): 106-114 (2012) - 2011
- [j88]Dorit S. Hochbaum, Barak Fishbain:
Nuclear threat detection with mobile distributed sensor networks. Ann. Oper. Res. 187(1): 45-63 (2011) - [i5]Ilan Adler, Dorit S. Hochbaum:
Benchmark Problems for Totally Unimodular Set System Auction. CoRR abs/1102.3499 (2011) - 2010
- [j85]Dorit S. Hochbaum, Asaf Levin:
How to allocate review tasks for robust ranking. Acta Informatica 47(5-6): 325-345 (2010) - [j82]Dorit S. Hochbaum, Asaf Levin:
Covering the edges of bipartite graphs using K2, 2 graphs. Theor. Comput. Sci. 411(1): 1-9 (2010) - [i3]Barak Fishbain, Dorit S. Hochbaum, Stefan Müller:
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems. CoRR abs/1007.4531 (2010) - 2009
- [j79]Dorit S. Hochbaum, Asaf Levin:
The multi-integer set cover and the facility terminal cover problem. Networks 53(1): 63-66 (2009) - 2008
- [j78]Ravindra K. Ahuja, Dorit S. Hochbaum:
Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time. Oper. Res. 56(1): 255-261 (2008) - 2007
- [c18]Dorit S. Hochbaum, Asaf Levin:
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. WAOA 2007: 116-127 - 2006
- [j73]Dorit S. Hochbaum, Asaf Levin:
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discret. Optim. 3(4): 327-340 (2006) - [j72]Dorit S. Hochbaum, Asaf Levin:
Methodologies and Algorithms for Group-Rankings Decision. Manag. Sci. 52(9): 1394-1408 (2006) - [j71]Dorit S. Hochbaum, Asaf Levin:
Optimizing over Consecutive 1's and Circular 1's Constraints. SIAM J. Optim. 17(2): 311-330 (2006) - [c17]Dorit S. Hochbaum, Asaf Levin:
The k-Allocation Problem and Its Variants. WAOA 2006: 253-264 - 2004
- [j69]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) - [r1]Philip M. Kaminsky, Dorit S. Hochbaum:
Due Date Quotation Models and Algorithms. Handbook of Scheduling 2004 - 2003
- [j65]Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem. Manag. Sci. 49(7): 950-964 (2003) - [j64]Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick:
The SONET edge-partition problem. Networks 41(1): 13-23 (2003) - [j63]Dorit S. Hochbaum, Maurice Queyranne:
Minimizing a Convex Cost Closure Set. SIAM J. Discret. Math. 16(2): 192-207 (2003) - 2002
- [j61]Ilan Adler, Alan L. Erera, Dorit S. Hochbaum, Eli V. Olinick:
Baseball, Optimization, and the World Wide Web. Interfaces 32(2): 12-22 (2002) - 2001
- [j59]Dorit S. Hochbaum, Eli V. Olinick:
The Bounded Cycle-Cover Problem. INFORMS J. Comput. 13(2): 104-119 (2001) - [j57]Alper Atamtürk, Dorit S. Hochbaum:
Capacity Acquisition, Subcontracting, and Lot Sizing. Manag. Sci. 47(8): 1081-1100 (2001) - 2000
- [c14]Dorit S. Hochbaum, Maurice Queyranne:
Minimizing a Convex Cost Closure Set. ESA 2000: 256-267 - 1999
- [j53]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) - [j52]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) - [c13]Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem. IPCO 1999: 31-44 - [e2]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. Lecture Notes in Computer Science 1671, Springer 1999, ISBN 3-540-66329-0 [contents] - 1998
- [j50]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) - [e1]Klaus Jansen, Dorit S. Hochbaum:
Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings. Lecture Notes in Computer Science 1444, Springer 1998, ISBN 3-540-64736-8 [contents] - 1997
- [j49]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) - [j47]Olivier Goldschmidt, Dorit S. Hochbaum:
k-edge Subgraph Problems. Discret. Appl. Math. 74(2): 159-169 (1997) - 1996
- [j41]Dorit S. Hochbaum, Joseph Naor:
Approximation Algorithms for Network Design Problems on Bounded Subsets. J. Algorithms 21(2): 403-414 (1996) - [j39]Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem. SIAM J. Discret. Math. 9(3): 492-509 (1996) - 1994
- [j34]Olivier Goldschmidt, Dorit S. Hochbaum:
A Polynomial Algorithm for the k-cut Problem for Fixed k. Math. Oper. Res. 19(1): 24-37 (1994) - [j33]Steven Cosares, Dorit S. Hochbaum:
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources. Math. Oper. Res. 19(1): 94-111 (1994) - [j30]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) - [c9]Naveen Garg, Dorit S. Hochbaum:
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. STOC 1994: 432-438 - 1993
- [j29]Dorit S. Hochbaum, Sridhar Seshadri:
The empirical performance of a polynomial algorithm for constrained nonlinear optimization. Ann. Oper. Res. 43(4): 229-248 (1993) - [j27]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) - [j26]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
- [j24]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) - [c8]Dorit S. Hochbaum, Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. IPCO 1992: 44-59 - 1991
- [j23]Dorit S. Hochbaum, Ron Shamir:
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem. Oper. Res. 39(4): 648-653 (1991) - 1990
- [j22]Dorit S. Hochbaum, Ron Shamir:
Minimizing the number of tardy job units under release time constraints. Discret. Appl. Math. 28(1): 45-57 (1990) - [j21]Dorit S. Hochbaum, J. George Shanthikumar:
Convex Separable Optimization Is Not Much Harder than Linear Optimization. J. ACM 37(4): 843-862 (1990) - [j20]Olivier Goldschmidt, Dorit S. Hochbaum:
A Fast Perfect-Matching Algorithm in Random Graphs. SIAM J. Discret. Math. 3(1): 48-57 (1990) - [j19]Olivier Goldschmidt, Dorit S. Hochbaum:
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph. SIAM J. Discret. Math. 3(1): 58-73 (1990) - 1989
- [j18]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) - [j17]Dorit S. Hochbaum, Arie Segev:
Analysis of a flow problem with fixed charges. Networks 19(3): 291-312 (1989) - [c6]Dorit S. Hochbaum, J. George Shanthikumar:
The Complexity of Nonlinear Separable Optimization. ICALP 1989: 461-472 - 1988
- [j16]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) - [c5]Olivier Goldschmidt, Dorit S. Hochbaum:
Polynomial Algorithm for the k-Cut Problem. FOCS 1988: 444-451 - 1987
- [j15]Dorit S. Hochbaum, David B. Shmoys:
Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1): 144-162 (1987) - [j14]Dorit S. Hochbaum, Wolfgang Maass:
Fast Approximation Algorithms for a Nonconvex Covering Problem. J. Algorithms 8(3): 305-323 (1987) - 1986
- [j11]Thomas A. Feo, Dorit S. Hochbaum:
OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing. Oper. Res. 34(6): 819-831 (1986) - [j10]Dorit S. Hochbaum, David B. Shmoys:
A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3): 533-550 (1986) - [j9]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) - [c4]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 - 1985
- [j8]Dorit S. Hochbaum, Wolfgang Maass:
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. J. ACM 32(1): 130-136 (1985) - [j7]Dorit S. Hochbaum, David B. Shmoys:
A Best Possible Heuristic for the k-Center Problem. Math. Oper. Res. 10(2): 180-184 (1985) - [c3]Dorit S. Hochbaum, David B. Shmoys:
Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results. FOCS 1985: 79-89 - 1984
- [c2]Dorit S. Hochbaum, Wolfgang Maass:
Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. STACS 1984: 55-62 - [c1]Dorit S. Hochbaum, David B. Shmoys:
Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems. STOC 1984: 324-333
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-03 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint