• Publications
  • Influence
An efficient targeting strategy for multiobject spectrograph surveys: The Sloan digital sky survey "tiling" algorithm
Large surveys using multiobject spectrographs require automated methods for deciding how to efficiently point observations and how to assign targets to each pointing. The Sloan Digital Sky SurveyExpand
Sequential and parallel algorithms for mixed packing and covering
  • N. Young
  • Computer Science, Mathematics
  • Proceedings IEEE International Conference on…
  • 8 October 2001
The main contribution is that the algorithms solve mixed packing and covering problems (in contrast to pure packing or pure covering problems, which have only "/spl les/" or only "/ spl ges/" inequalities) and run in time independent of the so-called width of the problem. Expand
Logical-shapelets: an expressive primitive for time series classification
This work introduces a novel algorithm that finds shapelets in less time than current methods by an order of magnitude, and shows for the first time an augmented shapelet representation that distinguishes the data based on conjunctions or disjunctions of shapelets. Expand
Competitive Paging Algorithms
The marking algorithm is developed, a randomized on-line algorithm for the paging problem, which it is proved that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. Expand
Balancing minimum spanning trees and shortest-path trees
A simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree is given and obtains the best-possible tradeoff. Expand
On-Line File Caching
  • N. Young
  • Computer Science
  • SODA '98
  • 17 May 2002
A simple deterministic on-line algorithm that generalizes many well-known paging and weighted-caching strategies, including least-recently-used, first-in-first-out, flush-when-full, and the balance algorithm is given. Expand
Randomized rounding without solving the linear program
  • N. Young
  • Mathematics, Computer Science
  • SODA '95
  • 22 January 1995
A new technique called oblivious rounding is introduced a variant of randomized rounding that avoids the bottleneck of first solving the linear program, which yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems. Expand
Faster parametric shortest path and minimum-balance algorithms
Experiments on random graphs suggest that the expected time for finding a minimum mean cycle with the algorithm is O(n log n + m) time, improved from O(nm log n) for the parametric shortest path algorithm of Karp and Orlin. Expand
Approximation algorithms for covering/packing integer programs
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{c^Tx:[email protected]?Z"+^n,Ax>=a,Bx==a) and multiplicity constraints (x=
Rounding algorithms for a geometric embedding of minimum multiway cut
The lower bound shows that this is the best algorithm that finds a cut of value 12/11 times the relaxation value, and a family of graphs with integrality gaps so-called integrality gap of the relaxation is exhibited. Expand