Parameterized Complexity Results in Symmetry Breaking
arXiv:1009.1174 · doi:10.1007/978-3-642-17493-3_3
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
Invited talk at IPEC 2010, 5th International Symposium on Parameterized and Exact Computation, December 13-15, 2010, Chennai, India http://www.imsc.res.in/ipec