Approximation of min coloring by moderately exponential algorithms - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett., 109(16):950-954, 2009. [doi]

The following publications are possibly variants of this publication:

Efficient approximation of min set cover by moderately exponential algorithmsNicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. TCS, 410(21-23):2184-2195, 2009. [doi]

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithmsNicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. DAM, 159(17):1954-1970, 2011. [doi]

Efficient Approximation of Combinatorial Problems by Moderately Exponential AlgorithmsNicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. wads 2009: 507-518 [doi]

Approximating MAX SAT by moderately exponential and parameterized algorithmsBruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire. TCS, 560:147-157, 2014. [doi]

Approximating MAX SAT by Moderately Exponential and Parameterized AlgorithmsBruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire. tamc 2012: 202-213 [doi]

runs on WebDSL