Dorit S. HOCHBAUM
Dorit S. HOCHBAUM
Dirección de correo verificada de ieor.berkeley.edu
Título
Citado por
Citado por
Año
Approximation algorithms for NP-hard problems
DS Hochba
ACM Sigact News 28 (2), 40-52, 1997
28621997
A best possible heuristic for the k-center problem
DS Hochbaum, DB Shmoys
Mathematics of operations research 10 (2), 180-184, 1985
10021985
Approximation schemes for covering and packing problems in image processing and VLSI
DS Hochbaum, W Maass
Journal of the ACM (JACM) 32 (1), 130-136, 1985
8211985
Using dual approximation algorithms for scheduling problems theoretical and practical results
DS Hochbaum, DB Shmoys
Journal of the ACM (JACM) 34 (1), 144-162, 1987
8091987
Approximation algorithms for the set covering and vertex cover problems
DS Hochbaum
SIAM Journal on computing 11 (3), 555-556, 1982
5751982
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
DS Hochbaum, DB Shmoys
SIAM journal on computing 17 (3), 539-551, 1988
3851988
A unified approach to approximation algorithms for bottleneck problems
DS Hochbaum, DB Shmoys
Journal of the ACM (JACM) 33 (3), 533-550, 1986
3661986
Heuristics for the fixed cost median problem
DS Hochbaum
Mathematical programming 22 (1), 148-162, 1982
3341982
Efficient bounds for the stable set, vertex cover and set packing problems
DS Hochbaum
Discrete Applied Mathematics 6 (3), 243-254, 1983
3081983
An efficient algorithm for co-segmentation
DS Hochbaum, V Singh
2009 IEEE 12th International Conference on Computer Vision, 269-276, 2009
2812009
Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems
DS Hochbaum
Approximation algorithms for NP-hard problems, 94-143, 1996
2801996
Convex separable optimization is not much harder than linear optimization
DS Hochbaum, JG Shanthikumar
Journal of the ACM (JACM) 37 (4), 843-862, 1990
2411990
A polynomial algorithm for the k-cut problem for fixed k
O Goldschmidt, DS Hochbaum
Mathematics of operations research 19 (1), 24-37, 1994
2361994
Analysis of the greedy approach in problems of maximum k‐coverage
DS Hochbaum, A Pathria
Naval Research Logistics (NRL) 45 (6), 615-627, 1998
2011998
The pseudoflow algorithm: A new algorithm for the maximum-flow problem
DS Hochbaum
Operations research 56 (4), 992-1009, 2008
2002008
An efficient algorithm for image segmentation, Markov random fields and related problems
DS Hochbaum
Journal of the ACM (JACM) 48 (4), 686-701, 2001
1902001
Simple and fast algorithms for linear and integer programs with two variables per inequality
DS Hochbaum, J Naor
SIAM Journal on Computing 23 (6), 1179-1192, 1994
1861994
Database location in computer networks
ML Fisher, DS Hochbaum
Journal of the ACM (JACM) 27 (4), 718-735, 1980
1811980
Scheduling semiconductor burn-in operations to minimize total flowtime
DS Hochbaum, D Landy
Operations research 45 (6), 874-885, 1997
1661997
Capacity acquisition, subcontracting, and lot sizing
A Atamtürk, DS Hochbaum
Management Science 47 (8), 1081-1100, 2001
1622001
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20