Tight Approximability Results for the Maximum Solution Equation Problem over Zp
2005 (English)In: Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings / [ed] Joanna Je¸drzejowicz and Andrzej Szepietowski, Springer Berlin/Heidelberg, 2005, , 628-639 p.628-639 p.Chapter in book (Refereed)
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 for the maximum solution equation problem when the equations are given over groups of the form Zp, where p is prime. We also prove that the weighted and unweighted versions of this problem have equal approximability thresholds. Furthermore, we show that the problem is equally hard to solve even if each equation is restricted to contain at most three variables and solvable in polynomial time if the equations are restricted to contain at most two variables. All of our results also hold for a generalised version of maximum solution equation where the elements of the group are mapped arbitrarily to non-negative integers in the objective function.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2005. , 628-639 p.628-639 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 3618
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 3618
IdentifiersURN: urn:nbn:se:liu:diva-31026DOI: 10.1007/11549345_54Local ID: 16729ISBN: 978-3-540-28702-5ISBN: 3-540-28702-7OAI: oai:DiVA.org:liu-31026DiVA: diva2:251849