Accelerated Parallel Algorithms for Packing Linear ProgrammingResearch Paper
A packing linear program asks for with . Packing LPs model resource allocation, fractional matching and fractional knapsack, and they are subroutines in approximation algorithms for scheduling and combinatorial auctions. The standard goal is low accuracy: a feasible …