pith. sign in

Neal E. Young

Identifiers

  • name variant Neal E. Young 0.60 · backfill

Papers (34)

  1. Balanced power diagrams for redistricting cs.DS · 2017 · author #3
  2. Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs cs.DS · 2014 · author #1
  3. First-Come-First-Served for Online Slot Allocation and Huffman Coding cs.DS · 2013 · author #3
  4. Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons cs.DS · 2013 · author #1
  5. Approximation Algorithms for the Joint Replenishment Problem with Deadlines cs.DS · 2012 · author #8
  6. Caching with rental cost and zapping cs.DS · 2012 · author #2
  7. Hamming Approximation of NP Witnesses cs.CC · 2012 · author #2
  8. On a Linear Program for Minimum-Weight Triangulation cs.CG · 2011 · author #2
  9. A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls cs.DS · 2010 · author #1
  10. Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost cs.DS · 2008 · author #2
  11. A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs cs.DS · 2008 · author #2
  12. The reverse greedy algorithm for the metric k-median problem cs.DS · 2005 · author #3
  13. Designing Multi-Commodity Flow Trees cs.DS · 2002 · author #3
  14. A New Operation on Sequences: the Boustrouphedon Transform math.CO · 2002 · author #3
  15. On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms cs.DS · 2002 · author #2
  16. Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut cs.DS · 2002 · author #5
  17. A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees cs.DS · 2002 · author #5
  18. Prefix Codes: Equiprobable Words, Unequal Letter Costs cs.DS · 2002 · author #2
  19. Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme cs.DS · 2002 · author #3
  20. K-Medians, Facility Location, and the Chernoff-Wald Bound cs.DS · 2002 · author #1
  21. The K-Server Dual and Loose Competitiveness for Paging cs.DS · 2002 · author #1
  22. Balancing Minimum Spanning and Shortest Path Trees cs.DS · 2002 · author #3
  23. Low-Degree Spanning Trees of Small Weight cs.DS · 2002 · author #3
  24. Orienting Graphs to Optimize Reachability cs.DS · 2002 · author #3
  25. Approximating the Minimum Equivalent Digraph cs.DS · 2002 · author #3
  26. Sequential and Parallel Algorithms for Mixed Packing and Covering cs.DS · 2002 · author #1
  27. Competitive Paging Algorithms cs.DS · 2002 · author #6
  28. Randomized Rounding without Solving the Linear Program cs.DS · 2002 · author #1
  29. Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory cs.CC · 2002 · author #2
  30. On-Line File Caching cs.DS · 2002 · author #1
  31. On-Line End-to-End Congestion Control cs.DS · 2002 · author #2
  32. Lecture Notes on Evasiveness of Graph Properties cs.CC · 2002 · author #2
  33. Approximation Algorithms for Covering/Packing Integer Programs cs.DS · 2002 · author #2
  34. On-Line Paging against Adversarially Biased Random Inputs cs.DS · 2002 · author #1

Mentions

  • 1303.2920 #1 · backfill · confidence 0.70 Neal E. Young
  • 1212.3233 #8 · backfill · confidence 0.70 Neal E. Young
  • 1208.2724 #2 · backfill · confidence 0.70 Neal E. Young
  • 1208.0257 #2 · backfill · confidence 0.70 Neal E. Young
  • 1111.5305 #2 · backfill · confidence 0.70 Neal E. Young
  • 1007.0217 #1 · backfill · confidence 0.70 Neal E. Young
  • 0807.0644 #2 · backfill · confidence 0.70 Neal E. Young
  • 0801.1987 #2 · backfill · confidence 0.70 Neal E. Young

Frequent Coauthors