Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

Voted

CORR
2002
Springer

favoriteEmaildiscussreport

133views Education» more CORR 2002»

Sequential and Parallel Algorithms for Mixed Packing and Covering

14 years 10 months ago

Sequential and Parallel Algorithms for Mixed Packing and Covering

Download www.cs.ucr.edu

We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly given problems, our fastest sequential algorithm returns a solution satisfying all constraints within a

Neal E. Young

Real-time Traffic

Algorithms | CORR 2002 | Education | Parallel Algorithm | Sequential Algorithm |

claim paper

Related Content

» Distributed algorithms for covering packing and maximum weighted matching

» An Approximation Algorithm for the General Mixed Packing and Covering Problem

» Approximation Algorithms for Mixed Fractional Packing and Covering Problems

» New approaches to covering and packing problems

» PrimalDual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

» Distributed and parallel algorithms for weighted vertex cover and other covering problems

» Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...

» A Robust PTAS for Machine Covering and Packing

» Resource Allocation in Distributed MixedCriticality CyberPhysical Systems

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	CORR
Authors	Neal E. Young

Comments (0)