Lp relaxation and tree packing for minimum k-CUT

Chandra Chekuri, Kent Quanrud, Chao Xu

Research output: Contribution to journalArticlepeer-review

Abstract

Karger used spanning tree packings [D. R. Karger, J. ACM, 47 (2000), pp. 46-76] to derive a near linear-time randomized algorithm for the global minimum cut problem as well as a bound on the number of approximate minimum cuts. This is a different approach from his well-known random contraction algorithm [D. R. Karger, Random Sampling in Graph Optimization Problems, Ph.D. thesis, Stanford University, Stanford, CA, 1995, D. R. Karger and C. Stein, J. ACM, 43 (1996), pp. 601-640]. Thorup developed a fast deterministic algorithm for the minimum k-cut problem via greedy recursive tree packings [M. Thorup, Minimum k-way cuts via deterministic greedy tree packing, in Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, ACM, 2008, pp. 159-166]. In this paper we revisit properties of an LP relaxation for k-Cut proposed by Naor and Rabani [Tree packing and approximating k-cuts, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 103, SIAM, Philadelphia, 2001, pp. 26-27], and analyzed in [C. Chekuri, S. Guha, and J. Naor, SIAM J. Discrete Math., 20 (2006), pp. 261-271]. We show that the dual of the LP yields a tree packing that, when combined with an upper bound on the integrality gap for the LP, easily and transparently extends Karger's analysis for mincut to the k-cut problem. In addition to the simplicity of the algorithm and its analysis, this allows us to improve the running time of Thorup's algorithm by a factor of n. We also improve the bound on the number of α -approximate k-cuts. Second, we give a simple proof that the integrality gap of the LP is 2(1 - 1/n). Third, we show that an optimum solution to the LP relaxation, for all values of k, is fully determined by the principal sequence of partitions of the input graph. This allows us to relate the LP relaxation to the Lagrangean relaxation approach of Barahona [Oper. Res. Lett., 26 (2000), pp. 99-105] and Ravi and Sinha [European J. Oper. Res., 186 (2008), pp. 77-90]; it also shows that the idealized recursive tree packing considered by Thorup gives an optimum dual solution to the LP.

Original languageEnglish (US)
Pages (from-to)1334-1353
Number of pages20
JournalSIAM Journal on Discrete Mathematics
Volume34
Issue number2
DOIs
StatePublished - 2020

Keywords

  • Approximation
  • K-cut
  • Minimum cut
  • Tree packing

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Lp relaxation and tree packing for minimum k-CUT'. Together they form a unique fingerprint.

Cite this