Dorit S. HOCHBAUM

Citace

	Všechny	Od 2019
Citace	17502	4055
h-index	54	28
i10-index	127	73

780

390

195

585

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202448 48 61 45 75 103 110 127 140 216 272 222 307 369 409 483 549 602 621 641 625 660 705 699 723 764 673 648 699 676 721 761 689 649 729 691 531

Veřejný přístup

Zobrazit všechny

33 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

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

Sledovat

Dorit S. HOCHBAUM

UC Berkeley

E-mailová adresa ověřena na: ieor.berkeley.edu


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Approximation algorithms for NP-hard problems DS Hochbaum ACM Sigact News, 1997	3076	1997
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1311	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	990	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	974	1985
Approximation algorithms for the set covering and vertex cover problems DS Hochbaum SIAM Journal on computing 11 (3), 555-556, 1982	675	1982
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	493	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	447	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	354	1996
Efficient bounds for the stable set, vertex cover and set packing problems DS Hochbaum Discrete Applied Mathematics 6 (3), 243-254, 1983	353	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	313	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	301	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	274	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	271	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	246	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

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři