Dorit S. HOCHBAUM

引用次數

	全部	自 2020 年
引文	17933	3642
H 指數	56	26
i10 指數	128	68

780

390

195

585

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202551 47 63 44 80 107 111 130 144 220 276 221 310 372 412 489 560 610 615 641 622 668 712 703 726 761 680 658 696 676 731 761 697 664 736 679 715 149

公開取用

查看全部

35 篇文章

0 篇文章

可供使用

無法使用

根據資金強制性政策

共同作者

David ShmoysProfessor of Operations Research & Information Engineering and of Computer Science在 cs.cornell.edu 的電子郵件地址已通過驗證
Asaf LevinProfessor in Operations Research, The Technion在 technion.ac.il 的電子郵件地址已通過驗證
Wolfgang MaassProfessor of Computer Science, Graz University of Technology在 igi.tugraz.at 的電子郵件地址已通過驗證
Philipp BaumannAssociate Professor in Quantitative Methods for Business Administration, University of Bern在 pqm.unibe.ch 的電子郵件地址已通過驗證
Quico SpaenSenior Applied Scientist, Amazon在 berkeley.edu 的電子郵件地址已通過驗證
Ron ShamirProfessor of Computer Science and Bioinformatics, Tel Aviv University在 tauex.tau.ac.il 的電子郵件地址已通過驗證
James B. OrlinProfessor, Massachusetts Institute of Technology在 mit.edu 的電子郵件地址已通過驗證
Barak FishbainEnvironmental, Water and Agricultural Engineering, The Faculty of Civil & Environmental Engineering在 technion.ac.il 的電子郵件地址已通過驗證
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of Florida在 optym.com 的電子郵件地址已通過驗證
Joseph Seffi NaorTechnion在 cs.technion.ac.il 的電子郵件地址已通過驗證
J. George ShanthikumarKrannert School of Management, Purdue University在 purdue.edu 的電子郵件地址已通過驗證
marshall fisherUPS Professor, Wharton, University of Pennsylvania在 wharton.upenn.edu 的電子郵件地址已通過驗證
Eli OlinickSouthern Methodist University在 lyle.smu.edu 的電子郵件地址已通過驗證
Nicholas G. HallProfessor of Operations Management, The Ohio State University在 osu.edu 的電子郵件地址已通過驗證
Erick Moreno-CentenoAssociate Professor of Industrial and Systems Engineering, Texas A&M University在 tamu.edu 的電子郵件地址已通過驗證
Alper AtamturkProfessor, UC Berkeley在 berkeley.edu 的電子郵件地址已通過驗證
Vikas SinghUniversity of Wisconsin Madison在 biostat.wisc.edu 的電子郵件地址已通過驗證
Steven CosaresCUNY - LaGuardia Community College在 lagcc.cuny.edu 的電子郵件地址已通過驗證
Nimrod MegiddoDistinguished Research Staff Member, IBM Almaden Research Center在 us.ibm.com 的電子郵件地址已通過驗證
David P. WilliamsonProfessor of Operations Research, Cornell University在 cornell.edu 的電子郵件地址已通過驗證

追蹤

Dorit S. HOCHBAUM

UC Berkeley

在 ieor.berkeley.edu 的電子郵件地址已通過驗證


標題按引用次數排序按年份排序按標題排序	引用次數引用次數	年份
Approximation algorithms for NP-hard problems DS Hochbaum ACM Sigact News, 1997	3130	1997
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1351	1985
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	1014	1987
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	998	1985
Approximation algorithms for the set covering and vertex cover problems DS Hochbaum SIAM Journal on computing 11 (3), 555-556, 1982	702	1982
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	512	1986
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	458	1988
Heuristics for the fixed cost median problem DS Hochbaum Mathematical programming 22, 148-162, 1982	397	1982
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	365	1997
Efficient bounds for the stable set, vertex cover and set packing problems DS Hochbaum Discrete Applied Mathematics 6 (3), 243-254, 1983	353	1983
The pseudoflow algorithm: A new algorithm for the maximum-flow problem DS Hochbaum Operations research 56 (4), 992-1009, 2008	328	2008
A polynomial algorithm for the k-cut problem for fixed k O Goldschmidt, DS Hochbaum Mathematics of operations research 19 (1), 24-37, 1994	320	1994
An efficient algorithm for co-segmentation DS Hochbaum, V Singh 2009 IEEE 12th International Conference on Computer Vision, 269-276, 2009	318	2009
Analysis of the greedy approach in problems of maximum k‐coverage DS Hochbaum, A Pathria Naval Research Logistics (NRL) 45 (6), 615-627, 1998	289	1998
Convex separable optimization is not much harder than linear optimization DS Hochbaum, JG Shanthikumar Journal of the ACM (JACM) 37 (4), 843-862, 1990	276	1990
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	248	2000
Methodologies and algorithms for group-rankings decision DS Hochbaum, A Levin Management Science 52 (9), 1394-1408, 2006	241	2006
An efficient algorithm for image segmentation, Markov random fields and related problems DS Hochbaum Journal of the ACM (JACM) 48 (4), 686-701, 2001	239	2001
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	215	1994
Database location in computer networks ML Fisher, DS Hochbaum Journal of the ACM (JACM) 27 (4), 718-735, 1980	197	1980

系統目前無法執行作業，請稍後再試。

文章 1–20

每年的引文數

重複引用

合併引文

新增共同作者共同作者

追蹤

引用次數

共同作者