Publication
STOC 2020
Conference paper

# New hardness results for planar graph problems in p and an algorithm for sparsest cut

View publication

## Abstract

The Sparsest Cut is a fundamental optimization problem that have been extensively studied. For planar inputs the problem is in P and can be solved in Õ(n 3 ) time if all vertex weights are 1. Despite a significant amount of effort, the best algorithms date back to the early 90's and can only achieve O(log n)-approximation in Õ(n) time or 3.5-approximation in Õ(n 2 ) time [Rao, STOC92]. Our main result is an ω(n 2-ϵ ) lower bound for Sparsest Cut even in planar graphs with unit vertex weights, under the (min, +)-Convolution conjecture, showing that approxima- tions are inevitable in the near-linear time regime. To complement the lower bound, we provide a 3.3-approximation in near-linear time, improving upon the 25-year old result of Rao in both time and accuracy. We also show that our lower bound is not far from optimal by observing an exact algorithm with running time Õ(n 5/2 ) improving upon the Õ(n 3 ) algorithm of Park and Phillips [STOC93]. Our lower bound accomplishes a repeatedly raised challenge by being the first fine-grained lower bound for a natural planar graph problem in P. Building on our construction we prove near-quadratic lower bounds under SETH for variants of the closest pair problem in planar graphs, and use them to show that the popular Average-Linkage procedure for Hierarchical Clustering cannot be simulated in truly subquadratic time. At the core of our constructions is a diamond-like gadget that also settles the complexity of Diameter in distributed planar networks. We prove an ω(n/ log n) lower bound on the number of communication rounds required to compute the weighted diameter of a network in the CONGET model, even when the underlying graph is planar and all nodes are D = 4 hops away from each other. This is the first poly(n) lower bound in the planar-distributed setting, and it complements the recent poly(D, log n) upper bounds of Li and Parter [STOC 2019] for (exact) unweighted diameter and for (1 + ϵ) approximate weighted diameter.

08 Jun 2020

STOC 2020
{"ft_lang_label":"__label__en","ft_lang_prob":0.90330845,"math_prob":0.91143894,"size":2089,"snap":"2023-40-2023-50","text_gpt3_token_len":487,"char_repetition_ratio":0.12470024,"word_repetition_ratio":0.0,"special_character_ratio":0.21637148,"punctuation_ratio":0.060913704,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9668172,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-22T00:21:03Z\",\"WARC-Record-ID\":\"<urn:uuid:051e873a-2cac-41ab-9f7c-dbc35b08ce23>\",\"Content-Length\":\"74180\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f166933e-ee32-4036-b9c8-28e5d9349c08>\",\"WARC-Concurrent-To\":\"<urn:uuid:93d0f9f8-1e75-442d-aee9-676550810742>\",\"WARC-IP-Address\":\"52.116.220.135\",\"WARC-Target-URI\":\"https://research.ibm.com/publications/new-hardness-results-for-planar-graph-problems-in-p-and-an-algorithm-for-sparsest-cut\",\"WARC-Payload-Digest\":\"sha1:N7WFPUQ2EWC2WYZTGCGJZSUCRUZAMP44\",\"WARC-Block-Digest\":\"sha1:AG2PE265WEZSVVTOULFZOGTUZSGWTXX3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506320.28_warc_CC-MAIN-20230922002008-20230922032008-00380.warc.gz\"}"}