Sciweavers

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

74

FOCS
1991
IEEE

favoriteEmaildiscussreport

114views Theoretical Computer Science» more FOCS 1991»

Fast Approximation Algorithms for Fractional Packing and Covering Problems

15 years 1 months ago

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Download infolab.stanford.edu

Serge A. Plotkin, David B. Shmoys, Éva Tard

Real-time Traffic

FOCS 1991 | Theoretical Computer Science |

claim paper

Related Content

» Approximation Algorithms for Mixed Fractional Packing and Covering Problems

» New approaches to covering and packing problems

» Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problem...

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

» Distributed algorithms for covering packing and maximum weighted matching

» Packing Scheduling Embedding and Approximating Metrics

» Online PrimalDual Algorithms for Covering and Packing Problems

» Weighted Geometric Set Cover via QuasiUniform Sampling

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

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	FOCS
Authors	Serge A. Plotkin, David B. Shmoys, Éva Tardos

Comments (0)