Sciweavers

CORR
2010
Springer

Parameterized Complexity Results in Symmetry Breaking

13 years 10 months ago
Parameterized Complexity Results in Symmetry Breaking
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into that intractability and help identify special cases in which symmetry can be dealt with more tractably.
Toby Walsh
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where CORR
Authors Toby Walsh
Comments (0)