TY - GEN

T1 - Maximizing polynomials subject to assignment constraints

AU - Makarychev, Konstantin

AU - Sviridenko, Maxim

PY - 2011/7/11

Y1 - 2011/7/11

N2 - We study the q-adic assignment problem. We first give an O(n (q-1)/2)-approximation algorithm for the Koopmans-Beckman version of the problem improving upon the result of Barvinok. Then, we introduce a new family of instances satisfying "tensor triangle inequalities" and give a constant factor approximation algorithm for them. We show that many classical optimization problems can be modeled by q-adic assignment problems from this family. Finally, we give several integrality gap examples for the natural LP relaxations of the problem.

AB - We study the q-adic assignment problem. We first give an O(n (q-1)/2)-approximation algorithm for the Koopmans-Beckman version of the problem improving upon the result of Barvinok. Then, we introduce a new family of instances satisfying "tensor triangle inequalities" and give a constant factor approximation algorithm for them. We show that many classical optimization problems can be modeled by q-adic assignment problems from this family. Finally, we give several integrality gap examples for the natural LP relaxations of the problem.

UR - http://www.scopus.com/inward/record.url?scp=79960011706&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960011706&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22006-7_43

DO - 10.1007/978-3-642-22006-7_43

M3 - Conference contribution

AN - SCOPUS:79960011706

SN - 9783642220050

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 510

EP - 520

BT - Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings

T2 - 38th International Colloquium on Automata, Languages and Programming, ICALP 2011

Y2 - 4 July 2011 through 8 July 2011

ER -