On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs

@article{CohenAddad2020OnLS,
  title={On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs},
  author={Vincent Cohen-Addad and Arnold Filtser and Philip N. Klein and Hung Le},
  journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2020},
  pages={589-600}
}
  • V. Cohen-AddadArnold Filtser Hung Le
  • Published 10 September 2020
  • Computer Science, Mathematics
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A fundamental idea that helps both to understand the structural properties of these metrics and lead to strong algorithmic results is to construct a “small-complexity” graph that approximately preserves distances between pairs of points of the metric. We show the two… 

Figures from this paper

Low Treewidth Embeddings of Planar and Minor-Free Metrics

  • Arnold FiltserHung Le
  • Computer Science, Mathematics
    2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
A new embedding technique is devised to improve the treewidth bound of Cohen-Addad et al. and obtain a deterministic embedding of planar graphs of diameter D into graphs oftreewidth and additive distortion that can be constructed in nearly linear time.

Low Treewidth Embeddings of Planar and Minor-Free Metrics

  • Bar-Ilan
  • Computer Science, Mathematics
  • 2022
A new embedding technique to improve the treewidth bound of Cohen-Addad et al. is devised and a deterministic embedding of planar graphs of diameter D into graphs oftreewidth O ((log log n ) 2 ) and additive distortion + (cid:15)D that can be constructed in nearly linear time is obtained.

Bypassing the surface embedding: approximation schemes for network design in minor-free graphs

Since the mid 90s, the study of the complexity of classic network design problems such as the traveling salesman problem (TSP), the Steiner tree problem (ST), or the k-MST problem on metric spaces

Clan embeddings into trees, and low treewidth graphs

This paper designs Ramsey-type embedding and clan embedding analogs of the stochastic embedding for minor-free graphs of diameter prameterized by D, which were known to be stochastically embeddable into bounded treewidth graphs with expected additive distortion є D.

Hop-Constrained Metric Embeddings and their Applications

  • Arnold Filtser
  • Computer Science
    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
This paper improves the Ramsey-type embedding to obtain parameters $t=\beta=\frac{\tilde{O}(\log n)}{\epsilon}$, and generalize it to arbitrary distortion parameter $t$ (in the cost of reducing the size of $M$).

Reliable Spanners: Locality-Sensitive Orderings Strike Back

This work constructs a locality-sensitive ordering for doubling metrics with a small number of orderings suitable for non-Euclidean metrics and constructs reliable spanners from the newly introduced locality- sensitive orderings via reliable 2-hop spanners for paths.

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators

The τ -lanky criterion is used to show that there exists a (1+ )-spanner for doubling metrics of dimension d with a constant maximum degree and a separator of size O(n1− 1 d ); this result resolves an open problem posed by Abam and Har-Peled a decade ago.

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs are presented, including graph of bounded treewidth, graphs of bounded highway dimensions, and graphs of bounds of bounded doubling dimensions.

Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency

  • Hung Le
  • Computer Science, Mathematics
    ArXiv
  • 2022
This workconstructs an oracle with O ( n log ( n )( (cid:15) − o ( 1 ) + log ∗ n )) space and log 2 + o (1 ) ( 1 / ( cid: 15) ) query time.

Light Spanners for High Dimensional Norms via Stochastic Decompositions

This paper shows that any n-point subset of ℓp\documentclass[12pt]{minimal} \usepackage{amsmath} ¬wasysym} £1,000,000 á¬2,500,000 is a spanner which is both sparse and also light, i.e., its total weight is not much larger than that of the minimum spanning tree.

References

SHOWING 1-10 OF 77 REFERENCES

Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs

We prove that any graph excluding Kr as a minor has can be partitioned into clusters of diameter at most Δ while removing at most O(r/Δ) fraction of the edges. This improves over the results of

Strong-Diameter Decompositions of Minor Free Graphs

The first sparse covers and probabilistic partitions for graphs excluding a fixed minor that have strong diameter bounds are provided; i.e. each set of the cover/partition has a small diameter as an induced sub-graph.

Metric embedding via shortest path decompositions

The main result is an O(kmin{1p,12})-distortion embedding, which is a super-exponential improvement over the best previous bound of Lee and Sidiropoulos and implies improved distortion on bounded treewidth graphs (O((klogn)1p)).

A PTAS for subset TSP in minor-free graphs

We give the first PTAS for the subset Traveling Salesperson Problem (TSP) in $H$-minor-free graphs. This resolves a long standing open problem in a long line of work on designing PTASes for TSP in

Contraction decomposition in h-minor-free graphs and algorithmic applications

We prove that any graph excluding a fixed minor can have its edges partitioned into a desired number k of color classes such that contracting the edges in any one color class results in a graph of

Local Tree-Width, Excluded Minors, and Approximation Algorithms

A decomposition theorem for graphs with excluded minors says that such graphs can be decomposed into trees of graphs of almost bounded local tree-width, and it is shown that a number of combinatorial optimization problems have a polynomial time approximation scheme when restricted to a class of graphs with an excluded minor.

An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor

For any graph that excludes a K r,r minor, Klein, Plotkin and Rao showed that this can be done while cutting only O(r 3/δ) fraction of the edges, which implies a bound on multicommodity max-flow min-cut ratio for such graphs.

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs

For planar graphs, bounded-genus graphs, and minor-excluded graphs, this paper gives distance-oracle constructions that require only O(n) space, and the big O hides only a fixed constant, independent of e and independent of genus or size of an excluded minor.

Preserving Terminal Distances Using Minors

The main result proves that f*(k)≥Ω(k2), significantly improving over the trivial f*[k]≥k, and the lower bound holds even for planar graphs G, in contrast to graphs G of constant treewidth, for which it is proved that O( k) vertices suffice.

Minor-Free Graphs Have Light Spanners

We show that every H-minor-free graph has a light (1+≥ilon)-spanner, resolving an open problem of Grigni and Sissokho and proving a conjecture of Grigni and Hung \cite{GH12}. Our lightness
...