Parameterized Complexity Results in Symmetry Breaking

TL;DR

This paper explores how parameterized complexity theory sheds light on the intractability of symmetry breaking in combinatorial problems and identifies cases where symmetry can be managed more efficiently.

Contribution

It connects parameterized complexity results to symmetry breaking, providing new insights into tractability and special cases in combinatorial problems.

Findings

Parameterized complexity offers insights into symmetry breaking in combinatorial problems.

Certain special cases allow more tractable symmetry management.

Theoretical framework links symmetry breaking difficulty to problem parameters.

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