# Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut

@inproceedings{Carufel2016MinimizingTC, title={Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut}, author={Jean-Lou De Carufel and Carsten Grimm and Anil Maheshwari and Stefan Schirra and Michiel Smid}, year={2016} }

We augment a tree $T$ with a shortcut $pq$ to minimize the largest distance between any two points along the resulting augmented tree $T+pq$. We study this problem in a continuous and geometric setting where $T$ is a geometric tree in the Euclidean plane, where a shortcut is a line segment connecting any two points along the edges of $T$, and we consider all points on $T+pq$ (i.e., vertices and points along edges) when determining the largest distance along $T+pq$. We refer to the largest… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

1

Twitter Mention

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

## Shortcut sets for plane Euclidean networks

VIEW 2 EXCERPTS

## Fast Algorithms for Diameter-Optimally Augmenting Paths

VIEW 2 EXCERPTS

## Augmenting Graphs to Minimize the Diameter

VIEW 2 EXCERPTS

## The parametric complexity of graph diameter augmentation

VIEW 1 EXCERPT

## Euclidean Chains and Their Shortcuts

VIEW 2 EXCERPTS