Neal Young (Akamai Technologies):
Sequential and Parallel Algorithms for Mixed Packing and Covering
"Mixed packing and covering" problems are those that can be
formulated as linear programs having non-negative
coefficients. Examples include multicommodity flow, computer
tomography, fractional set cover, knapsack, bin-packing,
scheduling problems, etc. I will present and analyze simple
and efficient algorithms for approximately solving these kinds
of problems.