The Semidefinite Relaxation of the k-Partition Polytope Is Strong

  • Andreas Eisenblätter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2337)


Radio frequency bandwidth has become a very scarce resource. This holds true in particular for the popular mobile communication system GSM. Carefully planning the use of the available frequencies is thus of great importance to GSM network operators. Heuristic optimization methods for this task are known, which produce frequency plans causing only moderate amounts of disturbing interference in many typical situations. In order to thoroughly assess the quality of the plans, however, lower bounds on the unavoidable interference are in demand. The results obtained so far using linear programming and graph theoretic arguments do not suffice. By far the best lower bounds are currently obtained from semidefinite programming. The link between semidefinite programming and the bound on unavoidable interference in frequency planning is the semidefinite relaxation of the graph minimum k-partition problem.

Here, we take first steps to explain the surprising strength of the semidefinite relaxation. This bases on a study of the solution set of the semidefinite relaxation in relation to the circumscribed k-partition polytope. Our focus is on the huge class of hypermetric inequalities, which are valid and in many cases facet-defining for the k-partition polytope. We show that a “slightly shifted version” of the hypermetric inequalities is implicit to the semidefinite relaxation. In particular, no feasible point for the semidefinite relaxation violates any of the facet-defining triangle inequalities for the k-partition polytope by more than √2 - 1 or any of the (exponentially many) facet-defining clique constraints by1/2 or more.


Valid Inequality Dual Solution Frequency Assignment Frequency Planning Integer Linear Programming Formulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aardal, K., Hurkens, C., Lenstra, J., Tiourine, S. Algorithms for Frequency Assignment Problems. CWI Quaterly, 9(1 & 2):1–8 (1996).zbMATHGoogle Scholar
  2. 2.
    Aardal, K. I., Hoesel, C. P. M. v., Koster, A. M. C. A., Mannino, C., Sassano, A. Models and solution techniques for the frequency assignment problem. ZIB Rep. 01-40, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany (2001). Available at Scholar
  3. 3.
    Alizadeh, F. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim., 5(1):12–51 (1995).MathSciNetCrossRefGoogle Scholar
  4. 4.
    Burer, S., Monteiro, R. D., Zhang, Y. Interior-point algorithms for semidefinite programming based on a nonlinear programming formulation. Tech. Rep. TR 99-27, Department of Computational and Applied Mathematics, Rice University (1999).Google Scholar
  5. 5.
    Chopra, S., Rao, M. R. The partition problem. Math. Program., 59:87–115 (1993).MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Chopra, S., Rao, M. R. Facets of the k-partition polytope. Discrete Appl. Math., 61:27–48 (1995).MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Correia, L. M. (ed.). COST259: Wireless Flexible Personalized Communications. J. Wiley & Sons (2001).Google Scholar
  8. 8.
    Deza, M. M., Grötschel, M., Laurent, M. Complete Descriptions of Small Multicut Polytopes. Applied Geometry and Discrete Mathematics—The Victor Klee Festschrift, 4:221–252 (1991).Google Scholar
  9. 9.
    Deza, M. M., Grötschel, M., Laurent, M. Clique-web facets for multicut polytopes. Math. Oper. Res., 17:981–1000 (1992).MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Deza, M. M., Laurent, M. Facets for the cut cone I. Math. Program., 56:121–160 (1992).MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Deza, M. M., Laurent, M. Geometry of Cuts and Metrics, vol. 15 of Algorithms and Combinatorics. Springer-Verlag (1997).Google Scholar
  12. 12.
    Eisenblätter, A. Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. Ph.D. thesis, TU Berlin, Germany (2001). Cuvillier-Verlag, ISBN 3-8987-3213-4, also available at Scholar
  13. 13.
    Erdős, P., Rubin, A. L., Taylor, H. Choosability in graphs. Congr. Numer., 26:125–157 (1979).Google Scholar
  14. 14.
    Eisenblätter, A., Koster, A. FAP web—a website about frequency assignment problems (2000). URL
  15. 15.
    Frieze, A., Jerrum, M. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18:67–81 (1997).MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Goemans, M. X., Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115–1145 (1995).MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Goldschmidt, O., Hochbaum, D. S. A polynomial algorithm for the k-cut problem for fixed k. Math. Oper. Res., 19:24–37 (1994).MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Grötschel, M., Lovász, L., Schrijver, A. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 2nd ed. (1994).Google Scholar
  19. 19.
    Grötschel, M., Wakabayashi, Y. Facets of the clique partitioning polytope. Math. Program., 47:367–387 (1990).zbMATHCrossRefGoogle Scholar
  20. 20.
    Hale, W. K. Frequency Assignment: Theory and Applications. In Proceedings of the IEEE, vol. 68, pp. 1497–1514. IEEE (1980).CrossRefGoogle Scholar
  21. 21.
    Helmberg, C. Semidefinite programming for combinatorial optimization. Habilitationsschrift, TU Berlin, Berlin, Germany (2000).Google Scholar
  22. 22.
    Hurkens, C., Tiourine, S. Upper and lower bounding techniques for frequency assignment problems. Tech. Rep., Eindhoven University of Technology, The Netherlands (1995).Google Scholar
  23. 23.
    Jaumard, B., Marcotte, O., Meyer, C. Mathematical models and exact methods for channel assignment in cellular networks. In Sansò, B., Soriano, P. (eds.), Telecommunications Network Planning, chap. 13, pp. 239–255. Kluwer Academic Publishers (1999).Google Scholar
  24. 24.
    Karger, D., Motwani, R., Sudan, M. Approximate graph coloring by semidefinite programming. J. ACM, 45(2):246–265 (1998).MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Koster, A. M. C. A. Frequency Assignment-Models and Algorithms. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands (1999).Google Scholar
  26. 26.
    Laurent, M., Poljak, S. On a positive semidefinite relaxation of the cut polytope. Linear Algebra Appl., 223/224:439–461 (1995).MathSciNetCrossRefGoogle Scholar
  27. 27.
    Lovász, L. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1–7 (1979).CrossRefGoogle Scholar
  28. 28.
    Poljak, S., Tuza, Z. Maximum cuts and large bipartite subgraphs. In Cook, W., Lovász, L., Seymour, P. (eds.), Combinatorial Optimization, vol. 20 of DIMACS Ser. in Discr Math. and Theoretical Comput. Sci., pp. 188–244. American Mathematical Society (1995).Google Scholar
  29. 29.
    Rutten, J. Polyhedral Clustering. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands (1998).Google Scholar
  30. 30.
    Schrijver, A. Theory of Linear and Integer Programming. J. Wiley & Sons (1986).Google Scholar
  31. 31.
    Verfaillie, G., Lemaître, M., Schiex, T. Russian doll search for solving constraint optimization problems. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pp. 181–187. Portland, OR, USA (1996).Google Scholar
  32. 32.
    West, D. B. Introduction to Graph Theory. Prentice Hall (1996).Google Scholar
  33. 33.
    Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.). Handbook on Semidefinite Programming, vol. 27. Kluwer Academic Publishers (2000).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Andreas Eisenblätter
    • 1
  1. 1.Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)BerlinGermany

Personalised recommendations