BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Germany
6 × USA
Collaborated with:
R.Levi R.Roundy É.Tardos D.S.Hochbaum H.An R.Kleinberg K.Aardal M.Charikar S.Guha S.Chakrabarti C.A.Phillips A.S.Schulz C.Stein J.Wein
Talks about:
algorithm (6) problem (4) approxim (3) inventori (2) improv (2) power (2) determinist (1) christofid (1) bottleneck (1) techniqu (1)

Person: David B. Shmoys

DBLP DBLP: Shmoys:David_B=

Facilitated 1 volumes:

STOC 2014Ed

Contributed to:

STOC 20122012
STOC 20062006
STOC 20042004
STOC 19991999
STOC 19971997
ICALP 19961996
STOC 19841984

Wrote 7 papers:

STOC-2012-AnKS #algorithm
Improving christofides’ algorithm for the s-t path TSP (HCA, RK, DBS), pp. 875–886.
STOC-2006-LeviRS #algorithm #modelling #probability
Provably near-optimal sampling-based algorithms for Stochastic inventory control models (RL, RR, DBS), pp. 739–748.
STOC-2004-LeviRS #algorithm #problem
Primal-dual algorithms for deterministic inventory problems (RL, RR, DBS), pp. 353–362.
STOC-1999-CharikarGTS #algorithm #approximate #problem
A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
STOC-1997-ShmoysTA #algorithm #approximate #problem
Approximation Algorithms for Facility Location Problems (DBS, ÉT, KA), pp. 265–274.
ICALP-1996-ChakrabartiPSSSW #algorithm #scheduling
Improved Scheduling Algorithms for Minsum Criteria (SC, CAP, ASS, DBS, CS, JW), pp. 646–657.
STOC-1984-HochbaumS #approximate #graph #problem
Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems (DSH, DBS), pp. 324–333.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.