You've reached the home page of Neal E. Young, associate professor in the Computer Science and Engineering department at the University of California, Riverside. I teach here and do research on the design and analysis of efficient approximation algorithms for combinatorial optimization problems.

• current schedule, contact information, and vita
• research publications, e.g.
  • 2008 Flooding overcomes small covering constraints (corrected draft)
  • 2007 Beating simplex for fractional packing and covering linear programs
  • 2004 Rounding algorithms for a geometric embedding of minimum multiway cut
  • 2002 On-line, end-to-end congestion control
  • 1999 On the number of iterations for Dantzig-Wolfe optimization and packing-covering ...
  • 1998 Data collection for the Sloan Digital Sky Survey: a network-flow heuristic
  • 1995 Randomized rounding without solving the linear program
  • 1994 The k-server dual and loose competitiveness for paging
  • 1991 Competitive paging algorithms
  • more...
• course materials, e.g.
  • cs 260, approximation algorithms (S'08)
  • cs 215, theory of computation (W'08)
  • cs 141, intermediate data structures and algorithms (F'07)
  • more...
• puzzles,