Sciweavers

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

193

ESCAPE
2007
Springer

350views Algorithms» more ESCAPE 2007»

An Approximation Algorithm for the General Mixed Packing and Covering Problem

15 years 8 months ago

An Approximation Algorithm for the General Mixed Packing and Covering Problem

Download www.informatik.uni-kiel.de

Florian Diedrich, Klaus Jansen

Real-time Traffic

Algorithms | ESCAPE 2007 |

claim paper

Related Content

» Approximation Algorithms for Mixed Fractional Packing and Covering Problems

» Sequential and Parallel Algorithms for Mixed Packing and Covering

» Distributed algorithms for covering packing and maximum weighted matching

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

» Improved approximation algorithms for multidimensional bin packing problems

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

» Near optimal online algorithms and fast approximation algorithms for resource allocation p...

» Fast Approximation Algorithms for Fractional Packing and Covering Problems

» Online PrimalDual Algorithms for Covering and Packing Problems

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	ESCAPE
Authors	Florian Diedrich, Klaus Jansen

Comments (0)