Dorit S. HOCHBAUM

Citata da

	Tutte	Dal 2020
Citazioni	17794	3554
Indice H	55	26
i10-index	128	66

780

390

195

585

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202548 48 62 45 79 104 110 129 137 222 272 219 308 369 410 484 550 601 620 642 625 663 703 701 726 764 678 649 698 678 724 765 690 652 733 685 715 76

Accesso pubblico

Visualizza tutto

34 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceEmail verificata su cs.cornell.edu
Asaf LevinProfessor in Operations Research, The TechnionEmail verificata su technion.ac.il
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyEmail verificata su igi.tugraz.at
Philipp BaumannAssociate Professor in Quantitative Methods for Business Administration, University of BernEmail verificata su pqm.unibe.ch
Ron ShamirProfessor of Computer Science and Bioinformatics, Tel Aviv UniversityEmail verificata su tauex.tau.ac.il
Quico SpaenSenior Applied Scientist, AmazonEmail verificata su berkeley.edu
James B. OrlinProfessor, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Barak FishbainEnvironmental, Water and Agricultural Engineering, The Faculty of Civil & Environmental EngineeringEmail verificata su technion.ac.il
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaEmail verificata su optym.com
Joseph Seffi NaorTechnionEmail verificata su cs.technion.ac.il
J. George ShanthikumarKrannert School of Management, Purdue UniversityEmail verificata su purdue.edu
Erick Moreno-CentenoAssociate Professor of Industrial and Systems Engineering, Texas A&M UniversityEmail verificata su tamu.edu
marshall fisherUPS Professor, Wharton, University of PennsylvaniaEmail verificata su wharton.upenn.edu
Eli OlinickSouthern Methodist UniversityEmail verificata su lyle.smu.edu
Nicholas G. HallProfessor of Operations Management, The Ohio State UniversityEmail verificata su osu.edu
Alper AtamturkProfessor, UC BerkeleyEmail verificata su berkeley.edu
Vikas SinghUniversity of Wisconsin MadisonEmail verificata su biostat.wisc.edu
Steven CosaresCUNY - LaGuardia Community CollegeEmail verificata su lagcc.cuny.edu
Nimrod MegiddoDistinguished Research Staff Member, IBM Almaden Research CenterEmail verificata su us.ibm.com
David P. WilliamsonProfessor of Operations Research, Cornell UniversityEmail verificata su cornell.edu

Segui

Dorit S. HOCHBAUM

UC Berkeley

Email verificata su ieor.berkeley.edu


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Approximation algorithms for NP-hard problems DS Hochbaum ACM Sigact News, 1997	3120	1997
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1336	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	1000	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	992	1985
Approximation algorithms for the set covering and vertex cover problems DS Hochbaum SIAM Journal on computing 11 (3), 555-556, 1982	689	1982
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	505	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	450	1988
Heuristics for the fixed cost median problem DS Hochbaum Mathematical programming 22, 148-162, 1982	396	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	364	1997
Efficient bounds for the stable set, vertex cover and set packing problems DS Hochbaum Discrete Applied Mathematics 6 (3), 243-254, 1983	356	1983
The pseudoflow algorithm: A new algorithm for the maximum-flow problem DS Hochbaum Operations research 56 (4), 992-1009, 2008	322	2008
An efficient algorithm for co-segmentation DS Hochbaum, V Singh 2009 IEEE 12th International Conference on Computer Vision, 269-276, 2009	318	2009
A polynomial algorithm for the k-cut problem for fixed k O Goldschmidt, DS Hochbaum Mathematics of operations research 19 (1), 24-37, 1994	306	1994
Analysis of the greedy approach in problems of maximum k‐coverage DS Hochbaum, A Pathria Naval Research Logistics (NRL) 45 (6), 615-627, 1998	283	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	277	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	251	2000
Methodologies and algorithms for group-rankings decision DS Hochbaum, A Levin Management Science 52 (9), 1394-1408, 2006	239	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	233	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	220	1994
Database location in computer networks ML Fisher, DS Hochbaum Journal of the ACM (JACM) 27 (4), 718-735, 1980	198	1980

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori