Sciweavers

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

28

DISOPT
2007

favoriteEmaildiscussreport

104views more DISOPT 2007»

Approximation of the Quadratic Set Covering problem

13 years 11 months ago

Approximation of the Quadratic Set Covering problem

Download hal.archives-ouvertes.fr

Bruno Escoffier, Peter L. Hammer

Real-time Traffic

DISOPT 2007 |

claim paper

Related Content

» Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Pr...

» Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation

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

» Approximation Algorithms for Partial Covering Problems

» On the PositiveNegative Partial Set Cover problem

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

» An Approximation Algorithm for the Minimum Latency Set Cover Problem

» Robust Solutions of Uncertain Quadratic and ConicQuadratic Problems

» Approximating node connectivity problems via set covers

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DISOPT
Authors	Bruno Escoffier, Peter L. Hammer

Comments (0)