Shortcuts for the Circle

@inproceedings{Bae2017ShortcutsFT,
  title={Shortcuts for the Circle},
  author={S. W. Bae and M. Berg and O. Cheong and J. Gudmundsson and C. Levcopoulos},
  booktitle={ISAAC},
  year={2017}
}
  • S. W. Bae, M. Berg, +2 authors C. Levcopoulos
  • Published in ISAAC 2017
  • Mathematics, Computer Science
  • Let C be the unit circle in R2. We can view C as a plane graph whose vertices are all the points on C, and the distance between any two points on C is the length of the smaller arc between them. We consider a graph augmentation problem on C, where we want to place k ≥ 1 shortcuts on C such that the diameter of the resulting graph is minimized. We analyze for each k with 1 ≤ k ≤ 7 what the optimal set of shortcuts is. Interestingly, the minimum diameter one can obtain is not a strictly… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    Euclidean Chains and Their Shortcuts
    • B. Yang
    • Computer Science, Mathematics
    • 2011
    3
    Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
    16
    Diameter bounds for altered graphs
    72
    Shortcut sets for plane Euclidean networks (Extended abstract)
    3
    Fast Algorithms for Diameter-Optimally Augmenting Paths
    16
    Diameter increase caused by edge deletion
    76
    ON A PROBLEM OF GRAPH THEORY
    448
    Bounded-Diameter Minimum-Cost Graph Problems
    16
    An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
    8
    Improved approximability and non-approximability results for graph diameter decreasing problems
    32