دنبال کردن
Dorit S. HOCHBAUM
Dorit S. HOCHBAUM
UC Berkeley
ایمیل تأیید شده در ieor.berkeley.edu
عنوان
نقل شده توسط
نقل شده توسط
سال
Approximation algorithms for NP-hard problems‏
DS Hochbaum‏
ACM Sigact News, 1997‏
31231997
A best possible heuristic for the k-center problem‏
DS Hochbaum, DB Shmoys‏
Mathematics of operations research 10 (2), 180-184, 1985‏
13491985
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‏
10111987
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‏
9971985
Approximation algorithms for the set covering and vertex cover problems‏
DS Hochbaum‏
SIAM Journal on computing 11 (3), 555-556, 1982‏
6981982
A unified approach to approximation algorithms for bottleneck problems‏
DS Hochbaum, DB Shmoys‏
Journal of the ACM (JACM) 33 (3), 533-550, 1986‏
5111986
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‏
4581988
Heuristics for the fixed cost median problem‏
DS Hochbaum‏
Mathematical programming 22, 148-162, 1982‏
3961982
Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems‏
DS Hochbaum‏
Approximation algorithms for NP-hard problems, 94-143, 1997‏
3641997
Efficient bounds for the stable set, vertex cover and set packing problems‏
DS Hochbaum‏
Discrete Applied Mathematics 6 (3), 243-254, 1983‏
3531983
The pseudoflow algorithm: A new algorithm for the maximum-flow problem‏
DS Hochbaum‏
Operations research 56 (4), 992-1009, 2008‏
3262008
A polynomial algorithm for the k-cut problem for fixed k‏
O Goldschmidt, DS Hochbaum‏
Mathematics of operations research 19 (1), 24-37, 1994‏
3191994
An efficient algorithm for co-segmentation‏
DS Hochbaum, V Singh‏
2009 IEEE 12th International Conference on Computer Vision, 269-276, 2009‏
3182009
Analysis of the greedy approach in problems of maximum k‐coverage‏
DS Hochbaum, A Pathria‏
Naval Research Logistics (NRL) 45 (6), 615-627, 1998‏
2881998
Convex separable optimization is not much harder than linear optimization‏
DS Hochbaum, JG Shanthikumar‏
Journal of the ACM (JACM) 37 (4), 843-862, 1990‏
2761990
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem‏
DS Hochbaum, A Chen‏
Operations Research 48 (6), 894-914, 2000‏
2482000
Methodologies and algorithms for group-rankings decision‏
DS Hochbaum, A Levin‏
Management Science 52 (9), 1394-1408, 2006‏
2402006
An efficient algorithm for image segmentation, Markov random fields and related problems‏
DS Hochbaum‏
Journal of the ACM (JACM) 48 (4), 686-701, 2001‏
2382001
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‏
2151994
Database location in computer networks‏
ML Fisher, DS Hochbaum‏
Journal of the ACM (JACM) 27 (4), 718-735, 1980‏
1971980
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–20