Sciweavers

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

115

Voted

WAOA
2004
Springer

favoriteEmaildiscussreport

146views Algorithms» more WAOA 2004»

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

15 years 2 months ago

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

Download www.ceid.upatras.gr

Klaus Jansen

Real-time Traffic

WAOA 2004 |

claim paper

Related Content

» Fast Approximation Algorithms for Fractional Packing and Covering Problems

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

» Distributed algorithms for covering packing and maximum weighted matching

» New approaches to covering and packing problems

» Sequential and Parallel Algorithms for Mixed Packing and Covering

» Online PrimalDual Algorithms for Covering and Packing Problems

» Weighted Geometric Set Cover via QuasiUniform Sampling

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

» Better approximation algorithms for bin covering

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	WAOA
Authors	Klaus Jansen

Comments (0)