Follow
Neal E. Young
Title
Cited by
Cited by
Year
An efficient targeting strategy for multiobject spectrograph surveys: the Sloan Digital Sky Survey
MR Blanton, H Lin, RH Lupton, FM Maley, NE Young, I Zehavi, J Loveday
The Astronomical Journal 125, 2276, 2003
7242003
Competitive paging algorithms
A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young
Journal of Algorithms 12 (4), 685-699, 1991
6051991
Logical-shapelets: an expressive primitive for time series classification
A Mueen, E Keogh, NE Young
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
4422011
Balancing minimum spanning trees and shortest-path trees
S Khuller, B Raghavachari, NE Young
Algorithmica 14 (4), 305--321, 1995
4051995
The k-server dual and loose competitiveness for paging
NE Young
Algorithmica 11 (6), 525-541, 1994
3171994
Randomized rounding without solving the linear program
NE Young
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995
266*1995
On-line file caching
NE Young
Algorithmica 33 (3), 371-383, 2002
2602002
Faster parametric shortest path and minimum‐balance algorithms
NE Young, RE Tarjan, JB Orlin
Networks 21 (2), 205-221, 1991
2441991
Sequential and parallel algorithms for mixed packing and covering
NE Young
Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001
2412001
Rounding algorithms for a geometric embedding of minimum multiway cut
DR Karger, P Klein, C Stein, M Thorup, NE Young
Mathematics of Operations Research 29 (3), 436-461, 2004
207*2004
On-line caching as cache size varies
NE Young
Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991
1521991
Approximating the minimum equivalent digraph
S Khuller, B Raghavachari, NE Young
SIAM Journal on Computing 24 (4), 859-872, 1995
1241995
A nearly linear-time PTAS for explicit fractional packing and covering linear programs
C Koufogiannakis, NE Young
Algorithmica 70 (4), 648–674, 2014
1202014
Low degree spanning trees of small weight
S Khuller, B Raghavachari, NE Young
SIAM Journal on Computing 25 (2), 355-368, 1998
116*1998
Simple strategies for large zero-sum games with applications to complexity theory
RJ Lipton, NE Young
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
1081994
On the number of iterations for Dantzig--Wolfe optimization and packing-covering approximation algorithms
P Klein, NE Young
SIAM Journal on Computing 44 (4), 1154-1172, 2015
96*2015
Approximation algorithms for covering/packing integer programs
SG Kolliopoulos, NE Young
Journal of Computer and System Sciences 71 (4), 495-505, 2005
942005
Polynomial-time approximation scheme for data broadcast
C Kenyon, N Schabanel, NE Young
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
852000
A primal-dual parallel approximation technique applied to weighted set and vertex covers
S Khuller, U Vishkin, NE Young
J. Algorithms 17 (2), 280-289, 1994
811994
The reverse greedy algorithm for the metric k-median problem
M Chrobak, C Kenyon, NE Young
Information Processing Letters 97 (2), 68-72, 2006
712006
The system can't perform the operation now. Try again later.
Articles 1–20