Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interesting problems in, for example, integer programming, equation solving, and graph theory. The approximability of this problem has previously been studied in the two-element case [Khanna et al, ‘The approximability of constraint satisfaction’, SIAM Journal on Computing 23(6), 2000] and in some algebraically motivated cases [Jonsson et al, ‘Max Ones generalized to larger domains’, SIAM Journal on Computing 38(1), 2008]. We continue this line of research by considering the approximability of Max Sol for different types of constraints. Our investigation combined with the older results strengthens the hypothesis that Max Sol exhibits a pentachotomy with respect to approximability.
KeywordsOptimisation approximability constraint satisfaction algebra computational complexity
Unable to display preview. Download preview PDF.
- 14.Szendrei, Á.: Clones in Universal Algebra. Seminaires de Mathématiques Supérieures, vol. 99. University of Montreal (1986)Google Scholar
- 15.Szendrei, Á.: Symmetric algebras. In: Contributions to General Algebra 6, pp. 259–280. Verlag Hölder-Pichler-Tempsky, Wien and Verlag Teubner, Stuttgart (1989)Google Scholar