Publications (34)
Low-Degree Spanning Trees of Small Weight
Samir Khuller, Balaji Raghavachari, Neal E. Young
On a Linear Program for Minimum-Weight Triangulation
Arman Yousefi, Neal E. Young
A New Operation on Sequences: the Boustrouphedon Transform
Jessica Millar, N. J. A. Sloane, Neal E. Young
The K-Server Dual and Loose Competitiveness for Paging
Neal E. Young
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
Mordecai Golin, Claire Mathieu, Neal E. Young
Lecture Notes on Evasiveness of Graph Properties
Laszlo Lovasz, Neal E. Young
Balancing Minimum Spanning and Shortest Path Trees
Samir Khuller, Balaji Raghavachari, Neal E. Young
Approximating the Minimum Equivalent Digraph
Samir Khuller, Balaji Raghavachari, Neal E. Young
Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Christos Koufogiannakis, Neal E. Young
Orienting Graphs to Optimize Reachability
S. L. Hakimi, E. Schmeichel, Neal E. Young
Sequential and Parallel Algorithms for Mixed Packing and Covering
Neal E. Young
Hamming Approximation of NP Witnesses
Daniel Sheldon, Neal E. Young
Approximation Algorithms for the Joint Replenishment Problem with Deadlines
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak +5
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
Christos Koufogiannakis, Neal E. Young
Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs
Neal E. Young
Competitive Paging Algorithms
Amos Fiat, Richard Karp, Mike Luby +3
Randomized Rounding without Solving the Linear Program
Neal E. Young
Balanced power diagrams for redistricting
Vincent Cohen-Addad, Philip N. Klein, Neal E. Young
On-Line File Caching
Neal E. Young
On-Line End-to-End Congestion Control
Naveen Garg, Neal E. Young
K-Medians, Facility Location, and the Chernoff-Wald Bound
Neal E. Young
Designing Multi-Commodity Flow Trees
Samir Khuller, Balaji Raghavachari, Neal E. Young
The reverse greedy algorithm for the metric k-median problem
Marek Chrobak, Claire Kenyon, Neal E. Young
Approximation Algorithms for Covering/Packing Integer Programs
Stavros G. Kolliopoulos, Neal E. Young
First-Come-First-Served for Online Slot Allocation and Huffman Coding
Monik Khare, Claire Mathieu, Neal E. Young
Caching with rental cost and zapping
Monik Khare, Neal E. Young
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
David Karger, Phil Klein, Cliff Stein +2
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
S. Fekete, S. Khuller, M. Klemmstein +2
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
Neal E. Young
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
Phil Klein, Neal E. Young
Prefix Codes: Equiprobable Words, Unequal Letter Costs
Mordecai Golin, Neal E. Young
Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory
Richard Lipton, Neal E. Young
On-Line Paging against Adversarially Biased Random Inputs
Neal E. Young
A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls
Neal E. Young