`Travelled to:`

1 × Greece

1 × Israel

1 × Latvia

2 × Canada

4 × USA

`Collaborated with:`

M.J.Golin C.Kenyon C.Koufogiannakis R.J.Lipton A.Mueen E.J.Keogh N.Schabanel S.Khuller B.Raghavachari D.R.Karger P.N.Klein C.Stein M.Thorup D.Agarwal D.Barman D.Gunopulos F.Korn D.Srivastava M.Bienkowski J.Byrka M.Chrobak N.B.Dobbs T.Nowicki M.Sviridenko G.Swirszcz

`Talks about:`

algorithm (3) approxim (3) cost (3) letter (2) unequ (2) time (2) code (2) submodular (1) constraint (1) replenish (1)

## Person: Neal E. Young

### DBLP: Young:Neal_E=

### Contributed to:

### Wrote 10 papers:

- ICALP-v1-2013-BienkowskiBCDNSSY #algorithm #approximate #problem
- Approximation Algorithms for the Joint Replenishment Problem with Deadlines (MB, JB, MC, NBD, TN, MS, GS, NEY), pp. 135–147.
- KDD-2011-MueenKY #classification #named
- Logical-shapelets: an expressive primitive for time series classification (AM, EJK, NEY), pp. 1154–1162.
- ICALP-v1-2009-KoufogiannakisY #algorithm #approximate #constraints
- Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (CK, NEY), pp. 634–652.
- KDD-2007-AgarwalBGYKS #effectiveness #performance #summary
- Efficient and effective explanation of change in hierarchical summaries (DA, DB, DG, NEY, FK, DS), pp. 6–15.
- STOC-2002-GolinKY
- Huffman coding with unequal letter costs (MJG, CK, NEY), pp. 785–791.
- STOC-2000-KenyonSY #approximate #polynomial
- Polynomial-time approximation scheme for data broadcast (CK, NS, NEY), pp. 659–666.
- STOC-1999-KargerKSTY #algorithm #geometry #multi
- Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
- ICALP-1994-GolinY #word
- Prefix Codes: Equiprobable Words, Unequal Letter Costs (MJG, NEY), pp. 605–617.
- STOC-1994-KhullerRY
- Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.
- STOC-1994-LiptonY #complexity #game studies #scalability
- Simple strategies for large zero-sum games with applications to complexity theory (RJL, NEY), pp. 734–740.