Near-Linear ε-Emulators for Planar Graphs

06/21/2022
by   Hsien-Chih Chang, et al.
0

We study vertex sparsification for distances, in the setting of planar graphs with distortion: Given a planar graph G (with edge weights) and a subset of k terminal vertices, the goal is to construct an ε-emulator, which is a small planar graph G' that contains the terminals and preserves the distances between the terminals up to factor 1+ε. We construct the first ε-emulators for planar graphs of near-linear size Õ(k/ε^O(1)). In terms of k, this is a dramatic improvement over the previous quadratic upper bound of Cheung, Goranci and Henzinger, and breaks below known quadratic lower bounds for exact emulators (the case when ε=0). Moreover, our emulators can be computed in (near-)linear time, which lead to fast (1+ε)-approximation algorithms for basic optimization problems on planar graphs, including multiple-source shortest paths, minimum (s,t)-cut, graph diameter, and dynamic distace oracle.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2020

New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut

The Sparsest Cut is a fundamental optimization problem that has been ext...
research
11/13/2018

Parametric Shortest Paths in Planar Graphs

We construct a family of planar graphs (G_n: n≥ 1), where G_n has n vert...
research
03/07/2019

A face cover perspective to ℓ_1 embeddings of planar graphs

It was conjectured by Gupta et. al. [Combinatorica04] that every planar ...
research
07/04/2018

Near-Optimal Distance Emulator for Planar Graphs

Given a graph G and a set of terminals T, a distance emulator of G is an...
research
06/09/2023

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions

Recently the authors [CCLMST23] introduced the notion of shortcut partit...
research
01/07/2019

Smaller Cuts, Higher Lower Bounds

This paper proves strong lower bounds for distributed computing in the C...
research
01/19/2017

The number of realizations of a Laman graph

Laman graphs model planar frameworks that are rigid for a general choice...

Please sign up or login with your details

Forgot password? Click here to reset