Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equations such that all equations are satisfied and the sum of the variables is maximised. We give tight approximability results...
Main Author: | Kuivinen, Fredrik |
---|---|
Format: | Others |
Language: | English |
Published: |
Linköpings universitet, Institutionen för datavetenskap
2005
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3240 |
Similar Items
-
On Approximation Algorithms for Coloring k-Colorable Graphs
by: HIRATA, Tomio, et al.
Published: (2003) -
Safe Approximation—An Efficient Solution for a Hard Routing Problem
by: András Faragó, et al.
Published: (2021-02-01) -
Parameterized complexity and polynomial-time approximation schemes
by: Huang, Xiuzhen
Published: (2005) -
Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
by: Wenner, Cenny
Published: (2014) -
Error evaluation of approximate solutions for sum-difference equations in two variables
by: Baburao G. Pachpatte
Published: (2009-08-01)