Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hochbaum, Dorit S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simplifications and speedups of the pseudoflow algorithm
Dorit S. Hochbaum
,
James B. Orlin
Networks
61
(1), 2013, pp. 40-57
Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores
Dorit S. Hochbaum
,
Chun-Nan Hsu
,
Yan T. Yang
Bioinformatics
28
(12), 2012, pp. 106-114
How to allocate review tasks for robust ranking
Dorit S. Hochbaum
,
Asaf Levin
Acta Informatica
47
(5-6), 2011, pp. 325-345
Complexity of some inverse shortest path lengths problems
Tingting Cui
,
Dorit S. Hochbaum
Networks
56
(1), 2010, pp. 20-29
Covering the edges of bipartite graphs using
K_{2,2}
graphs
Dorit S. Hochbaum
,
Asaf Levin
Theoretical Computer Science
411
(1), 2010, pp. 1-9
The multi-integer set cover and the facility terminal cover problem
Dorit S. Hochbaum
,
Asaf Levin
Networks
53
(1), 2009, pp. 63-66
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
Ravindra K. Ahuja
,
Dorit S. Hochbaum
,
James B. Orlin
Algorithmica
39
(3), 2004, pp. 189-208
The SONET edge-partition problem
Olivier Goldschmidt
,
Dorit S. Hochbaum
,
Asaf Levin
,
Eli V. Olinick
Networks
41
(1), 2003, pp. 13-23
Minimizing a convex cost closure set
Dorit S. Hochbaum
,
Maurice Queyranne
SIAM Journal on Discrete Mathematics
16
(2), 2003, pp. 192-207
Minimax problems with bitonic matrices
Dorit S. Hochbaum
,
Paul A. Tucker
Networks
40
(3), 2002, pp. 113-124
An efficient algorithm for image segmentation, Markov random fields and related problems
Dorit S. Hochbaum
Journal of the ACM
48
(4), 2001, pp. 686-701
A new-old algorithm for minimum-cut and maximum-flow in closure graphs
Dorit S. Hochbaum
Networks
37
(4), 2001, pp. 171-193
Approximating a generalization of MAX 2SAT and MIN 2SAT
Dorit S. Hochbaum
,
Anu Pathria
Discrete Applied Mathematics
107
(1-3), 2000, pp. 41-59
Minimizing a convex cost closure set
Dorit S. Hochbaum
,
Maurice Queyranne
Lecture Notes in Computer Science
1879
, 2000, pp. 256-267
Solving the convex cost integer dual network flow problem
Ravindra K. Ahuja
,
Dorit S. Hochbaum
,
James B. Orlin
Lecture Notes in Computer Science
1610
, 1999, pp. 31-44
Approximating clique and biclique problems
Dorit S. Hochbaum
Journal of Algorithms
29
(1), 1998, pp. 174-200
The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem
Dorit S. Hochbaum
Lecture Notes in Computer Science
1412
, 1998, pp. 325-337
Instant recognition of half integrality and 2-approximations
Dorit S. Hochbaum
Lecture Notes in Computer Science
1444
, 1998, pp. 99-110
The
t
-vertex cover problem: Extending the half integrality framework with budget constraints
Dorit S. Hochbaum
Lecture Notes in Computer Science
1444
, 1998, pp. 111-122
k
-edge subgraph problems
Olivier Goldschmidt
,
Dorit S. Hochbaum
Discrete Applied Mathematics
74
(2), 1997, pp. 159-169
Scheduling with batching: Two job types
Dorit S. Hochbaum
,
Dan Landy
Discrete Applied Mathematics
72
(1-2), 1997, pp. 99-114
Approximation algorithms for network design problems on bounded subsets
Dorit S. Hochbaum
,
Joseph (Seffi) Naor
Journal of Algorithms
21
(2), 1996, pp. 403-414
The bottleneck graph partition problem
Dorit S. Hochbaum
,
Anu Pathria
Networks
28
(4), 1996, pp. 221-225
An
O(\log k)
approximation algorithm for the
k
minimum spanning tree problem in the plane
Naveen Garg
,
Dorit S. Hochbaum
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 432-438
Simple and fast algorithms for linear and integer programs with two variables per inequality
Dorit S. Hochbaum
,
Joseph (Seffi) Naor
SIAM Journal on Computing
23
(6), 1994, pp. 1179-1192
Seiten 1
2
>