Dorit S. HOCHBAUM

Citeras av

	Alla	Sedan 2020
Citat	17920	3631
h-index	56	26
i10-index	128	67

760

380

190

570

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202551 47 63 44 80 107 111 130 144 220 276 221 310 372 412 489 560 610 615 641 623 667 711 703 726 760 680 657 697 676 732 759 696 666 736 678 719 134

Offentlig åtkomst

Visa alla

35 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceVerifierad e-postadress på cs.cornell.edu
Asaf LevinProfessor in Operations Research, The TechnionVerifierad e-postadress på technion.ac.il
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerifierad e-postadress på igi.tugraz.at
Quico SpaenSenior Applied Scientist, AmazonVerifierad e-postadress på berkeley.edu
Ron ShamirProfessor of Computer Science and Bioinformatics, Tel Aviv UniversityVerifierad e-postadress på tauex.tau.ac.il
Philipp BaumannAssociate Professor in Quantitative Methods for Business Administration, University of BernVerifierad e-postadress på pqm.unibe.ch
James B. OrlinProfessor, Massachusetts Institute of TechnologyVerifierad e-postadress på mit.edu
Barak FishbainEnvironmental, Water and Agricultural Engineering, The Faculty of Civil & Environmental EngineeringVerifierad e-postadress på technion.ac.il
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaVerifierad e-postadress på optym.com
Joseph Seffi NaorTechnionVerifierad e-postadress på cs.technion.ac.il
J. George ShanthikumarKrannert School of Management, Purdue UniversityVerifierad e-postadress på purdue.edu
Erick Moreno-CentenoAssociate Professor of Industrial and Systems Engineering, Texas A&M UniversityVerifierad e-postadress på tamu.edu
marshall fisherUPS Professor, Wharton, University of PennsylvaniaVerifierad e-postadress på wharton.upenn.edu
Eli OlinickSouthern Methodist UniversityVerifierad e-postadress på lyle.smu.edu
Nicholas G. HallProfessor of Operations Management, The Ohio State UniversityVerifierad e-postadress på osu.edu
Alper AtamturkProfessor, UC BerkeleyVerifierad e-postadress på berkeley.edu
Vikas SinghUniversity of Wisconsin MadisonVerifierad e-postadress på biostat.wisc.edu
Steven CosaresCUNY - LaGuardia Community CollegeVerifierad e-postadress på lagcc.cuny.edu
Nimrod MegiddoDistinguished Research Staff Member, IBM Almaden Research CenterVerifierad e-postadress på us.ibm.com
David P. WilliamsonProfessor of Operations Research, Cornell UniversityVerifierad e-postadress på cornell.edu

Följ

Dorit S. HOCHBAUM

UC Berkeley

Verifierad e-postadress på ieor.berkeley.edu


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Approximation algorithms for NP-hard problems DS Hochbaum ACM Sigact News, 1997	3128	1997
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1352	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	1013	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	700	1982
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	511	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	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	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	327	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	288	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	240	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	238	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

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare