The metric relaxation for 0-extension admits an Ω(log2/3k) gap
Authors: 
Roy Schwartz, Nitzan TurAuthors Info & Claims
Roy Schwartz, Nitzan TurAuthors Info & ClaimsPages 1601 - 1614
Abstract
We consider the 0-Extension problem, where we are given an undirected graph G=(V,E) equipped with non-negative edge weights w:E→ ℝ+, a collection T={ t1,…,tk}⊆ V of k special vertices called terminals, and a semi-metric D over T. The goal is to assign every non-terminal vertex to a terminal while minimizing the sum over all edges of the weight of the edge multiplied by the distance in D between the terminals to which the endpoints of the edge are assigned. 0-Extension admits two known algorithms, achieving approximations of O(logk) [Călinescu-Karloff-Rabani SICOMP ’05] and O(logk/loglogk) [Fakcharoenphol-Harrelson-Rao-Talwar SODA ’03]. Both known algorithms are based on rounding a natural linear programming relaxation called the metric relaxation, in which D is extended from T to the entire of V. The current best known integrality gap for the metric relaxation is Ω (√logk). In this work we present an improved integrality gap of Ω(log2/3k) for the metric relaxation. Our construction is based on the randomized extension of one graph by another, a notion that captures lifts of graphs as a special case and might be of independent interest. Inspired by algebraic topology, our analysis of the gap instance is based on proving no continuous section (in the topological sense) exists in the randomized extension.
References
[1]
Naman Agarwal, Alexandra Kolla, and Vivek Madan. 2013. Small Lifts of Expander Graphs are Expanding. ArXiv, abs/1311.3268, 2013.
[2]
Haris Angelidakis, Yury Makarychev, and Pasin Manurangsi. 2017. An Improved Integrality Gap for the C\u alinescu-Karloff-Rabani Relaxation for Multiway Cut. In Integer Programming and Combinatorial Optimization. Springer International Publishing. Pages 39–50.
[3]
Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, and \'Eva Tardos. 2004. Approximate Classification via Earthmover Metrics. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '04. Pages 1079–1087.
[4]
Sanjeev Arora, David Karger, and Marek Karpinski. 1999. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. J. Comput. System Sci., 58, 1, 1999. Pages 193 – 210.
[5]
Sanjeev Arora, Subhash A. Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, and Nisheeth K. Vishnoi. 2008. Unique Games on Expanding Constraint Graphs Are Easy: Extended Abstract. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing. STOC '08. Pages 21–28.
[6]
Y. Bartal. 1996. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of 37th Conference on Foundations of Computer Science. FOCS '96. Pages 184–193.
[7]
Yair Bartal. 1998. On Approximating Arbitrary Metrices by Tree Metrics. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. STOC '98. Pages 161–168.
[8]
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, and Vivek Madan. 2019. Improving the Integrality Gap for Multiway Cut. In Integer Programming and Combinatorial Optimization. Springer International Publishing. Pages 115–127.
[9]
Yonatan Bilu and Nathan Linial. 2006. Lifts, Discrepancy and Nearly Optimal Spectral Gap*. Combinatorica, 26, 10, 2006. Pages 495–519.
[10]
Niv Buchbinder, Joseph (Seffi) Naor, and Roy Schwartz. 2018. Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput., 47, 1, 2018. Pages 1463–1482.
[11]
Niv Buchbinder, Roy Schwartz, and Baruch Weizman. 2017. Simplex Transformations and the Multiway Cut Problem. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '17. Pages 2400–2410.
[12]
Niv Buchbinder, Roy Schwartz, and Baruch Weizman. 2019. A simple algorithm for the multiway cut problem. Operations Research Letters, 47, 6, 2019. Pages 587 – 593.
[13]
Gruia C\u alinescu, Howard Karloff, and Yuval Rabani. 2005. Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput., 34, 2, 2005. Pages 358–372.
[14]
Gruia C\u alinescu, Howard J. Karloff, and Yuval Rabani. 2000. An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci., 60, 3, 2000. Pages 564–574.
[15]
Chandra Chekuri, Sanjeev Khanna, Joseph Naor, and Leonid Zosin. 2004. A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM J. Discrete Math., 18, 3, 2004. Pages 608–625.
[16]
Kevin Cheung, William Cunningham, and Lawrence Tang. 2006. Optimal 3-terminal cuts and linear programming. Math. Program., 106, 5, 2006. Pages 1–23.
[17]
Julia Chuzhoy and Joseph (Seffi) Naor. 2007. The Hardness of Metric Labeling. SIAM J. Comput., 36, 5, 2007. Pages 1376–1386.
[18]
E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. 1994. The Complexity of Multiterminal Cuts. SIAM J. Comput., 23, 1994. Pages 864–894.
[19]
Reinhard Diestel. 2005. Graph Theory (Graduate Texts in Mathematics). Springer.
[20]
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, and Kunal Talwar. 2003. An Improved Approximation Algorithm for the 0-Extension Problem. In Symposium on Discrete Algorithms. SODA '03. Pages 257–265.
[21]
Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. 2007. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci., 69, 3, October, 2007. Pages 485–497.
[22]
Ari Freund and Howard J. Karloff. 2000. A lower bound of 8/(7+(1/k-1)) on the integrality ratio of the \mbox Calinescu-\mbox Karloff-\mbox Rabani relaxation for multiway cut. Inf. Process. Lett., 75, 1-2, 2000. Pages 43–50.
[23]
J. Friedman. 2003. Relative expanders or weakly relatively Ramanujan graphs. Duke Mathematical Journal, 118, 2003. Pages 19–35.
[24]
Alan M. Frieze and Ravi Kannan. 1996. The regularity lemma and approximation schemes for dense problems. In Proceedings of 37th Conference on Foundations of Computer Science. FOCS '96. Pages 12–20.
[25]
Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. 2004. Multiway cuts in node weighted graphs. J. Algorithms, 50, 1, 2004. Pages 49–61.
[26]
Anupam Gupta and \'Eva Tardos. 2000. A Constant Factor Approximation Algorithm for a Class of Classification Problems. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing. STOC '00. Pages 652–658.
[27]
William Johnson, Joram Lindenstrauss, and Gideon Schechtman. 1986. Extensions of lipschitz maps into Banach spaces. Israel Journal of Mathematics, 54, 6, 1986. Pages 129–138.
[28]
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, and Neal E. Young. 2004. Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res., 29, 3, 2004. Pages 436–461.
[29]
Howard Karloff, Subhash Khot, Aranyak Mehta, and Yuval Rabani. 2009. On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput., 39, 1, 2009. Pages 371–387.
[30]
Alexander V. Karzanov. 1998. Minimum 0-Extensions of Graph Metrics. European Journal of Combinatorics, 19, 1, 1998. Pages 71 – 101.
[31]
Subhash Khot and Oded Regev. 2008. Vertex cover might be hard to approximate to within 2-\epsilon . J. Comput. Syst. Sci., 74, 3, May, 2008. Pages 335–349.
[32]
Jon Kleinberg and \'Eva Tardos. 2002. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. J. ACM, 49, 5, 2002. Pages 616–639.
[33]
R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. 2005. Measured descent: A new embedding method for finite metrics. Geometric And Functional Analysis, 15, 4, 2005. Pages 839–858.
[34]
James Lee and Assaf Naor. 2004. Extending Lipschitz functions via random metric partitions. Inventiones mathematicae, 160, 2, 2004.
[35]
N. Linial and Doron Puder. 2010. Word maps and spectra of random graph lifts. Random Struct. Algorithms, 37, 2010. Pages 100–135.
[36]
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. 1988. Ramanujan Graphs. Combinatorica, 8, 09, 1988. Pages 261–277.
[37]
Rajsekar Manokaran, Joseph (Seffi) Naor, Prasad Raghavendra, and Roy Schwartz. 2008. Sdp Gaps and Ugc Hardness for Multiway Cut, 0-Extension, and Metric Labeling. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing. STOC '08. Pages 11–20.
[38]
A. Marcus, D. A. Spielman, and N. Srivastava. 2013. Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. FOCS '13. Pages 529–537.
[39]
Sidhanth Mohanty and Ryan O'Donnell. 2020. X-Ramanujan graphs. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. SODA '20. Pages 1226–1243.
[40]
Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes. 2020. Explicit near-Ramanujan graphs of every degree. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. STOC '20. Pages 510–523.
[41]
Joseph Naor and Leonid Zosin. 2001. A 2-Approximation Algorithm for the Directed Multiway Cut Problem. SIAM J. Comput., 31, 2, 2001. Pages 477–482.
[42]
Ryan O'Donnell and Xinyu Wu. 2020. Explicit near-fully X-Ramanujan graphs.
[43]
Eyal Rozenman, Aner Shalev, and Avi Wigderson. 2006. Iterative Construction of Cayley Expander Graphs. Theory of Computing, 2, 1, 2006. Pages 91–120.
[44]
Ankit Sharma and Jan Vondrák. 2014. Multiway cut, pairwise realizable distributions, and descending thresholds. In Symposium on Theory of Computing, STOC 2014. Pages 724–733.
Index Terms
- The metric relaxation for 0-extension admits an Ω(log2/3k) gap
Recommendations
On Earthmover Distance, Metric Labeling, and 0-Extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in graph theory and to Lipschitz extensions in Banach spaces; its generalization ...
On earthmover distance, metric labeling, and 0-extension
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingWe study the fundamental classification problems O-EXTENSION and METRIC LABELING. MINIMUM WEIGHT TRIANGULATION is closely related to partitioning problems in graph theory and to Lipschitz extensions in Banach spaces; its generalization METRIC LABELING ...
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree
In the Directed Steiner Tree (DST) problem, we are given a directed graph \(G=(V,E)\) on \(n\) vertices with edge-costs \(c\in{\mathbb{R}}_{\geq 0}^{E}\) , a root vertex \(r\in V\) , and a set \(K\subseteq V\setminus\{r\}\) of \(k\) terminals. ...
Comments
Information & Contributors
Information
Published In
June 2021
1797 pages
ISBN:9781450380539
DOI:10.1145/3406325
- General Chair:
- Samir Khuller,
- Program Chair:
- Virginia Vassilevska Williams
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 June 2021
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
STOC '21
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 67Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 27 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in