Остановите войну!
for scientists:
default search action
Dorit S. Hochbaum
- > Home > Persons > Dorit S. Hochbaum
Publications
- 2024
- [i18]Dorit S. Hochbaum:
Binary weights spanning trees and the k-red spanning tree problem in linear time. CoRR abs/2401.07341 (2024) - 2023
- [c35]Dorit S. Hochbaum:
Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. KDIR 2023: 365-372 - 2021
- [j114]Dorit S. Hochbaum:
Applications and efficient algorithms for integer programming problems on monotone constraints. Networks 77(1): 21-49 (2021) - 2019
- [j105]Dorit S. Hochbaum:
Algorithms and complexity of range clustering. Networks 73(2): 170-186 (2019) - 2018
- [j103]Dorit S. Hochbaum:
Complexity and approximations for submodular minimization problems on two variables per inequality constraints. Discret. Appl. Math. 250: 252-261 (2018) - [i8]Dorit S. Hochbaum:
Algorithms and Complexity of Range Clustering. CoRR abs/1805.04984 (2018) - 2016
- [j99]Dorit S. Hochbaum:
A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem. Comput. Ind. Eng. 95: 64-71 (2016) - [i7]Dorit S. Hochbaum:
Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm. CoRR abs/1610.04012 (2016) - 2013
- [j92]Dorit S. Hochbaum:
A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant. Oper. Res. 61(1): 184-198 (2013) - 2011
- [c21]Dorit S. Hochbaum:
An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization. SSVM 2011: 338-349 - 2010
- [j83]Dorit S. Hochbaum:
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut. IEEE Trans. Pattern Anal. Mach. Intell. 32(5): 889-898 (2010) - [i2]Dorit S. Hochbaum:
Submodular problems - approximations and algorithms. CoRR abs/1010.1945 (2010) - 2009
- [j81]Dorit S. Hochbaum:
Dynamic evolution of economically preferred facilities. Eur. J. Oper. Res. 193(3): 649-659 (2009) - [c20]Dorit S. Hochbaum:
An Efficient and Effective Image Segmentation Interactive Tool. BIOSIGNALS 2009: 459-461 - 2008
- [j77]Dorit S. Hochbaum:
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem. Oper. Res. 56(4): 992-1009 (2008) - [i1]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) - 2007
- [j74]Dorit S. Hochbaum:
Complexity and algorithms for nonlinear optimization problems. Ann. Oper. Res. 153(1): 257-296 (2007) - 2006
- [c16]Dorit S. Hochbaum:
Ranking Sports Teams and the Inverse Equal Paths Problem. WINE 2006: 307-318 - 2005
- [j70]Dorit S. Hochbaum:
Complexity and algorithms for convex network optimization and other nonlinear problems. 4OR 3(3): 171-216 (2005) - 2004
- [j68]Dorit S. Hochbaum:
50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today. Manag. Sci. 50(6): 709-723 (2004) - [j67]Dorit S. Hochbaum:
Monotonizing linear programs with up to two nonzeroes per column. Oper. Res. Lett. 32(1): 49-58 (2004) - 2003
- [j66]Dorit S. Hochbaum:
Efficient Algorithms for the Inverse Spanning-Tree Problem. Oper. Res. 51(5): 785-797 (2003) - 2002
- [j62]Dorit S. Hochbaum:
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. Eur. J. Oper. Res. 140(2): 291-321 (2002) - 2001
- [j58]Dorit S. Hochbaum:
An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM 48(4): 686-701 (2001) - [j56]Dorit S. Hochbaum:
A new - old algorithm for minimum-cut and maximum-flow in closure graphs. Networks 37(4): 171-193 (2001) - 2000
- [c15]Dorit S. Hochbaum:
Instant recognition of polynominal time solvability, half integrality and 2-approximations. APPROX 2000: 2-14 - 1998
- [j51]Dorit S. Hochbaum:
Approximating Clique and Biclique Problems. J. Algorithms 29(1): 174-200 (1998) - [c12]Dorit S. Hochbaum:
Instant Recognition of Half Integrality and 2-Approximations. APPROX 1998: 99-110 - [c11]Dorit S. Hochbaum:
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints. APPROX 1998: 111-122 - [c10]Dorit S. Hochbaum:
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. IPCO 1998: 325-337 - 1997
- [j42]Dorit S. Hochbaum:
Approximation Algorithms for NP-Hard Problems. SIGACT News 28(2): 40-52 (1997) - 1996
- [j37]Dorit S. Hochbaum:
An optimal test compression procedure for combinational circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(10): 1294-1299 (1996) - 1995
- [j35]Dorit S. Hochbaum:
A nonlinear Knapsack problem. Oper. Res. Lett. 17(3): 103-110 (1995) - 1994
- [j32]Dorit S. Hochbaum:
Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems. Math. Oper. Res. 19(2): 390-409 (1994) - 1993
- [j28]Dorit S. Hochbaum:
Why Should Biconnected Components be Identified First. Discret. Appl. Math. 42(2): 203-210 (1993) - 1992
- [j25]Dorit S. Hochbaum:
An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs. Oper. Res. 40(5): 923-935 (1992) - 1990
- [c7]Dorit S. Hochbaum:
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions. IPCO 1990: 261-273 - 1984
- [j6]Dorit S. Hochbaum:
When are NP-hard location problems easy? Ann. Oper. Res. 1(3): 201-214 (1984) - 1983
- [j5]Dorit S. Hochbaum:
Efficient bounds for the stable set, vertex cover and set packing problems. Discret. Appl. Math. 6(3): 243-254 (1983) - 1982
- [j4]Dorit S. Hochbaum:
Heuristics for the fixed cost median problem. Math. Program. 22(1): 148-162 (1982) - [j3]Dorit S. Hochbaum:
Approximation Algorithms for the Set Covering and Vertex Cover Problems. SIAM J. Comput. 11(3): 555-556 (1982)
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-25 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint