Sciweavers

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

9

CSR
2010
Springer

favoriteEmaildiscussreport

104views Theoretical Computer Science» more CSR 2010»

The max quasi-independent set Problem

13 years 4 months ago

The max quasi-independent set Problem

Download www.lamsade.dauphine.fr

Nicolas Bourgeois, Aristotelis Giannakos, Giorgio

Real-time Traffic

CSR 2010 | Theoretical Computer Science |

claim paper

Related Content

» The Generalized MaxControlled Set Problem

» MaxSet An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Se...

» Solving Sparse Random Instances of Max Cut and Max 2CSP in Linear Expected Time

» Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems

» Inapproximability of the Perimeter Defense Problem

» Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

» Exploring the Relationship Between MaxCut and Stable Set Relaxations

» Hard constraint satisfaction problems have hard gaps at location 1

» Coordinatized Kernels and Catalytic Reductions An Improved FPT Algorithm for Max Leaf Span...

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	CSR
Authors	Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié

Comments (0)