Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2010: Automata, Languages and Programming pp 594–604Cite as

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6198))

Abstract

We show that for every positive ε> 0, unless \({\mathcal NP} \subset {\mathcal BPQP}\), it is impossible to approximate the maximum quadratic assignment problem within a factor better than \(2^{\log^{1-\varepsilon} n}\) by a reduction from the maximum label cover problem. Then, we present an \(O(\sqrt{n})\)-approximation algorithm for the problem based on rounding of the linear programming relaxation often used in the state of the art exact algorithms.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, W.P., Johnson, T.A.: Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 43–77 (1994)

    Google Scholar 

  2. Anstreicher, K.: Recent advances in the solution of quadratic assignment problems. In: Anstreicher, K. (ed.) ISMP, 2003. Copenhagen. Math. Program, Ser. B, vol. 97(1-2), pp. 27–42 (2003)

    Google Scholar 

  3. Arkin, E., Hassin, R., Sviridenko, M.: Approximating the Maximum Quadratic Assignment Problem. Information Processing Letters 77, 13–16 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming 92(1), 1–36 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Arora, S., Lund, C.: Hardness of Approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems. PWS Publishing (1996)

    Google Scholar 

  6. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3)

    Google Scholar 

  7. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122

    Google Scholar 

  8. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting High Log-Densities – an \(O(n^{\frac{1}{4}})\) Approximation for Densest k-Subgraph. In: Proceedings of STOC (to appear, 2010)

    Google Scholar 

  9. Burkard, R.E., Cela, E., Pardalos, P., Pitsoulis, L.S.: The quadratic assignment problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. 241–339. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  10. Burkard, R.E., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM, Philadelphia (2009)

    MATH  Google Scholar 

  11. Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  12. Dong, Y., Wolkowicz, H.: A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem. Mathematics of Operations Research 34, 1008–1022 (2009)

    Article  MathSciNet  Google Scholar 

  13. Dickey, J., Hopkins, J.: Campus building arrangement using TOPAZ. Transportation Science 6, 59–68 (1972)

    Google Scholar 

  14. Eiselt, H., Laporte, G.: A combinatorial optimization problem arising in dartboard design. Journal of Operational Research Society 42, 113–118 (1991)

    Google Scholar 

  15. Elshafei, A.: Hospital layout as a quadratic assignment problem. Operations Research Quarterly 28, 167–179 (1977)

    Article  Google Scholar 

  16. Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of STOC 2002 , pp. 534–543 (2002)

    Google Scholar 

  17. Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19(2), 175–220 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Geoffrion, A., Graves, G.: Scheduling parallel production lines with changeover costs: Practical applications of a quadratic assignment/LP approach. Operations Research 24, 596–610 (1976)

    Article  Google Scholar 

  19. Hassin, R., Levin, A., Sviridenko, M.: Approximating the minimum quadratic assignment problems. ACM Transactions on Algorithms 6(1) (2009)

    Google Scholar 

  20. Khot, S.: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In: Proceedings of FOCS 2004, pp. 136–145 (2004)

    Google Scholar 

  21. Koopmans, T.C., Beckman, M.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nagarajan, V., Sviridenko, M.: On the maximum quadratic assignment problem. Mathematics of Operations Research 34(4), 859–868 (2009); preliminary version appeared in Proceedings of SODA 2009, pp. 516–524

    Google Scholar 

  23. Laporte, G., Mercure, H.: Balancing hydraulic turbine runners: A quadratic assignment problem. European Journal of Operations Research 35, 378–381 (1988)

    Article  Google Scholar 

  24. Loilola, E.M., De Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P.M., Querido, T.: A survey for the quadratic assignment problem. Invited Review, European Journal of Operational Research 176, 657–690 (2006)

    Article  Google Scholar 

  25. Pardalos, P., Wolkowitz, H. (eds.): Proceedings of the DIMACS Workshop on Quadratic Assignment Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16 (1994)

    Google Scholar 

  26. Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18, 1–11 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  27. Raz, R.: A Parallel Repetition Theorem. SIAM Journal on Computing 27, 763–803 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  28. Queyranne, M.: Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Operations Research Letters 4, 231–234 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  29. Steinberg, L.: The backboard wiring problem: a placement algorithm. SIAM Rev. 3, 37–50 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  30. Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite Programming Relaxations for the Quadratic Assignment Problem. Journal of Combinatorial Optimization 2, 71–109 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 10598

    Konstantin Makarychev & Maxim Sviridenko

  2. Princeton University, Princeton, NJ, 08544

    Rajsekar Manokaran

Authors
  1. Konstantin Makarychev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajsekar Manokaran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maxim Sviridenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Samson Abramsky

  2. Université de Bordeaux (LaBRI) & INRIA, 351, cours de la Libération, 33405, Talence Cedex, France

    Cyril Gavoille

  3. INRIA, Centre de Recherche Bordeaux – Sud-Ouest, 351 cours de la Libération, 33405, Talence Cedex, France

    Claude Kirchner

  4. Heinz Nixdorf Institute, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Friedhelm Meyer auf der Heide

  5. University of Patras and RACTI, 26500, Patras, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makarychev, K., Manokaran, R., Sviridenko, M. (2010). Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14165-2_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14164-5

  • Online ISBN: 978-3-642-14165-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation