DeepAI AI Chat
Log In Sign Up

Improved Girth Approximation and Roundtrip Spanners

by   Shiri Chechik, et al.

In this paper we provide improved algorithms for approximating the girth and producing roundtrip spanners of n-node m-edge directed graphs with non-negative edge lengths. First, for any integer k > 1, we provide a deterministic Õ(m^1+ 1/k) time algorithm which computes a O(k n) multiplicative approximation of the girth and a O(k n) multiplicative roundtrip spanner with Õ(n^1+1/k) edges. Second, we provide a randomized Õ(m√(n)) time algorithm that with high probability computes a 3-multiplicative approximation to the girth. Third, we show how to combine these algorithms to obtain for any integer k > 1 a randomized algorithm which in Õ(m^1+ 1/k) time computes a O(k k) multiplicative approximation of the girth and O(k k) multiplicative roundtrip spanner with high probability. The previous fastest algorithms for these problems either ran in All-Pairs Shortest Paths (APSP) time, i.e. Õ(mn), or were due Pachocki et al (SODA 2018) which provided a randomized algorithm that for any integer k > 1 in time Õ(m^1+1/k) computed with high probability a O(k n) multiplicative approximation of the girth and a O(k n) multiplicative roundtrip spanners with Õ(n^1+1/k) edges. Our first algorithm removes the need for randomness and improves the approximation factor in Pachocki et al (SODA 2018), our second is constitutes the first sub-APSP-time algorithm for approximating the girth to constant accuracy with high probability, and our third is the first time versus quality trade-offs for obtaining constant approximations.


page 1

page 2

page 3

page 4


A Randomized Algorithm for Edge-Colouring Graphs in O(m√(n)) Time

We present a simple randomized algorithm to edge-colour arbitrary simple...

An O(n) time algorithm for finding Hamilton cycles with high probability

We design a randomized algorithm that finds a Hamilton cycle in 𝒪(n) tim...

Faster approximation algorithms for computing shortest cycles on weighted graphs

Given an n-vertex m-edge graph G with non negative edge-weights, the gir...

Constant factor approximations to edit distance on far input pairs in nearly linear time

For any T ≥ 1, there are constants R=R(T) ≥ 1 and ζ=ζ(T)>0 and a randomi...

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks

This paper addresses the following fundamental maximum throughput routin...

Efficient polynomial-time approximation scheme for the genus of dense graphs

The main results of this paper provide an Efficient Polynomial-Time Appr...

Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs

We describe the first sub-quadratic sampling algorithm for the Multiplic...