Dorit S. HOCHBAUM

Citée par

	Toutes	Depuis 2016
Citations	14833	3783
indice h	54	29
indice i10	118	70

800

400

200

600

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202144 48 50 40 68 105 101 129 124 217 274 214 284 329 376 475 543 562 610 636 599 681 703 712 699 750 674 655 698 693 678 789 694 227

Accès public

Tout afficher

14 articles

2 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceAdresse e-mail validée de cs.cornell.edu
Asaf LevinAssociate Professor in Operations Research, The TechnionAdresse e-mail validée de technion.ac.il
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyAdresse e-mail validée de igi.tugraz.at
Ron ShamirProfessor of Computer Science and Bioinformatics, Tel Aviv UniversityAdresse e-mail validée de tau.ac.il
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaAdresse e-mail validée de optym.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyAdresse e-mail validée de mit.edu
Joseph Seffi NaorTechnionAdresse e-mail validée de cs.technion.ac.il
Barak FishbainEnvironmental, Water and Agricultural Engineering, The Faculty of Civil & Environmental EngineeringAdresse e-mail validée de technion.ac.il
Quico SpaenApplied Scientist, AmazonAdresse e-mail validée de berkeley.edu
J. George ShanthikumarKrannert School of Management, Purdue UniversityAdresse e-mail validée de purdue.edu
Erick Moreno-CentenoAssociate Professor of Industrial and Systems Engineering, Texas A&M UniversityAdresse e-mail validée de tamu.edu
Eli OlinickSouthern Methodist UniversityAdresse e-mail validée de lyle.smu.edu
marshall fisherUPS Professor, Wharton, University of PennsylvaniaAdresse e-mail validée de wharton.upenn.edu
Philipp BaumannAssociate Professor in Quantitative Methods for Business Administration, University of BernAdresse e-mail validée de pqm.unibe.ch
Nicholas G. HallProfessor of Operations Management, The Ohio State UniversityAdresse e-mail validée de osu.edu
Alper AtamturkProfessor, UC BerkeleyAdresse e-mail validée de berkeley.edu
Vikas SinghUniversity of Wisconsin MadisonAdresse e-mail validée de biostat.wisc.edu
Steven CosaresCUNY - LaGuardia Community CollegeAdresse e-mail validée de lagcc.cuny.edu
Nimrod MegiddoDistinguished Research Staff Member, IBM Almaden Research CenterAdresse e-mail validée de us.ibm.com
David P. WilliamsonProfessor of Operations Research, Cornell UniversityAdresse e-mail validée de cornell.edu

Dorit S. HOCHBAUM

UC Berkeley

Adresse e-mail validée de ieor.berkeley.edu


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Approximation algorithms for NP-hard problems DS Hochba ACM Sigact News 28 (2), 40-52, 1997	2681	1997
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1066	1985
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	842	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	841	1987
Approximation algorithms for the set covering and vertex cover problems DS Hochbaum SIAM Journal on computing 11 (3), 555-556, 1982	608	1982
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	398	1988
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	383	1986
Heuristics for the fixed cost median problem DS Hochbaum Mathematical programming 22 (1), 148-162, 1982	356	1982
Efficient bounds for the stable set, vertex cover and set packing problems DS Hochbaum Discrete Applied Mathematics 6 (3), 243-254, 1983	322	1983
An efficient algorithm for co-segmentation DS Hochbaum, V Singh 2009 IEEE 12th International Conference on Computer Vision, 269-276, 2009	293	2009
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	284	1996
A polynomial algorithm for the k-cut problem for fixed k O Goldschmidt, DS Hochbaum Mathematics of operations research 19 (1), 24-37, 1994	253	1994
Convex separable optimization is not much harder than linear optimization DS Hochbaum, JG Shanthikumar Journal of the ACM (JACM) 37 (4), 843-862, 1990	238	1990
The pseudoflow algorithm: A new algorithm for the maximum-flow problem DS Hochbaum Operations research 56 (4), 992-1009, 2008	214	2008
Analysis of the greedy approach in problems of maximum k‐coverage DS Hochbaum, A Pathria Naval Research Logistics (NRL) 45 (6), 615-627, 1998	210	1998
An efficient algorithm for image segmentation, Markov random fields and related problems DS Hochbaum Journal of the ACM (JACM) 48 (4), 686-701, 2001	198	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	186	1994
Database location in computer networks ML Fisher, DS Hochbaum Journal of the ACM (JACM) 27 (4), 718-735, 1980	179	1980
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	171	2000
Capacity acquisition, subcontracting, and lot sizing A Atamtürk, DS Hochbaum Management Science 47 (8), 1081-1100, 2001	168	2001

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Importer un PDF

Suivre les mises à jour de cet auteur

Citée par

Coauteurs