Dorit S. HOCHBAUM

Citado por

	Todos	Desde 2019
Citações	17609	4148
Índice h	54	29
Índice i10	128	74

780

390

195

585

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202448 48 61 45 78 103 110 129 140 216 272 219 308 369 410 483 549 602 621 641 626 661 705 699 726 764 672 649 699 677 724 764 690 652 730 688 617

Acesso público

Ver todos

33 artigos

0 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceE-mail confirmado em cs.cornell.edu
Asaf LevinProfessor in Operations Research, The TechnionE-mail confirmado em technion.ac.il
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyE-mail confirmado em igi.tugraz.at
Ron ShamirProfessor of Computer Science and Bioinformatics, Tel Aviv UniversityE-mail confirmado em tau.ac.il
Philipp BaumannAssociate Professor in Quantitative Methods for Business Administration, University of BernE-mail confirmado em pqm.unibe.ch
Quico SpaenSenior Applied Scientist, AmazonE-mail confirmado em berkeley.edu
James B. OrlinProfessor, Massachusetts Institute of TechnologyE-mail confirmado em mit.edu
Barak FishbainEnvironmental, Water and Agricultural Engineering, The Faculty of Civil & Environmental EngineeringE-mail confirmado em technion.ac.il
Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaE-mail confirmado em optym.com
Joseph Seffi NaorTechnionE-mail confirmado em cs.technion.ac.il
J. George ShanthikumarKrannert School of Management, Purdue UniversityE-mail confirmado em purdue.edu
Erick Moreno-CentenoAssociate Professor of Industrial and Systems Engineering, Texas A&M UniversityE-mail confirmado em tamu.edu
marshall fisherUPS Professor, Wharton, University of PennsylvaniaE-mail confirmado em wharton.upenn.edu
Eli OlinickSouthern Methodist UniversityE-mail confirmado em lyle.smu.edu
Nicholas G. HallProfessor of Operations Management, The Ohio State UniversityE-mail confirmado em osu.edu
Alper AtamturkProfessor, UC BerkeleyE-mail confirmado em berkeley.edu
Vikas SinghUniversity of Wisconsin MadisonE-mail confirmado em biostat.wisc.edu
Steven CosaresCUNY - LaGuardia Community CollegeE-mail confirmado em lagcc.cuny.edu
Nimrod MegiddoDistinguished Research Staff Member, IBM Almaden Research CenterE-mail confirmado em us.ibm.com
David P. WilliamsonProfessor of Operations Research, Cornell UniversityE-mail confirmado em cornell.edu

Seguir

Dorit S. HOCHBAUM

UC Berkeley

E-mail confirmado em ieor.berkeley.edu


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Approximation algorithms for NP-hard problems DS Hochbaum ACM Sigact News, 1997	3095	1997
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1318	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	995	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	982	1985
Approximation algorithms for the set covering and vertex cover problems DS Hochbaum SIAM Journal on computing 11 (3), 555-556, 1982	680	1982
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	499	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	449	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, 1996	357	1996
Efficient bounds for the stable set, vertex cover and set packing problems DS Hochbaum Discrete Applied Mathematics 6 (3), 243-254, 1983	355	1983
An efficient algorithm for co-segmentation DS Hochbaum, V Singh 2009 IEEE 12th International Conference on Computer Vision, 269-276, 2009	317	2009
The pseudoflow algorithm: A new algorithm for the maximum-flow problem DS Hochbaum Operations research 56 (4), 992-1009, 2008	315	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	305	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	275	1990
Analysis of the greedy approach in problems of maximum k‐coverage DS Hochbaum, A Pathria Naval Research Logistics (NRL) 45 (6), 615-627, 1998	274	1998
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	250	2000
Methodologies and algorithms for group-rankings decision DS Hochbaum, A Levin Management Science 52 (9), 1394-1408, 2006	232	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	229	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	218	1994
Database location in computer networks ML Fisher, DS Hochbaum Journal of the ACM (JACM) 27 (4), 718-735, 1980	198	1980

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores