DeepAI AI Chat
Log In Sign Up

Improving the dilation of a metric graph by adding edges

by   Joachim Gudmundsson, et al.
The University of Sydney

Most of the literature on spanners focuses on building the graph from scratch. This paper instead focuses on adding edges to improve an existing graph. A major open problem in this field is: given a graph embedded in a metric space, and a budget of k edges, which k edges do we add to produce a minimum-dilation graph? The special case where k=1 has been studied in the past, but no major breakthroughs have been made for k > 1. We provide the first positive result, an O(k)-approximation algorithm that runs in O(n^3 logn) time.


page 1

page 2

page 3

page 4


Strong Hanani-Tutte for the Torus

If a graph can be drawn on the torus so that every two independent edges...

On restricted completions of chordal and trivially perfect graphs

Let G be a graph having a vertex v such that H = G - v is a trivially pe...

Metric Violation Distance: Revisited and Extended

Metric data plays an important role in various settings such as metric-b...

Breaching the 2-Approximation Barrier for the Forest Augmentation Problem

The basic goal of survivable network design is to build cheap networks t...

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination

We consider the budgeted version of the classical connected dominating s...

A Unified Framework for Hopsets and Spanners

Given an undirected graph G=(V,E), an (α,β)-spanner H=(V,E') is a subgra...

Improving on Best-of-Many-Christofides for T-tours

The T-tour problem is a natural generalization of TSP and Path TSP. Give...