Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T13:08:06.313Z Has data issue: false hasContentIssue false
  • English
  • Français

DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION

Part of: Theory of computing

Published online by Cambridge University Press:  23 October 2019

PATRICK JOHN ANDERSEN Open the ORCID record for PATRICK JOHN ANDERSEN [Opens in a new window]
PATRICK JOHN ANDERSEN*
Affiliation:
School of Mathematics and Statistics, The University of Melbourne, Parkville, Victoria 3010, Australia email pat.j.andersen@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

minimum spanning treesbottleneck objectiveapproximation algorithmsdiscrete geometrybounded degreecombinatorial optimisation

MSC classification

Primary: 90C27: Combinatorial optimization
Secondary: 68Q25: Analysis of algorithms and problem complexity 68U05: Computer graphics; computational geometry 90C59: Approximation methods and heuristics
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 101 , Issue 1 , February 2020 , pp. 170 - 171
Copyright
© 2019 Australian Mathematical Publishing Association Inc. 

Footnotes

Thesis submitted to the University of Melbourne in January 2019; degree approved on 17 April 2019; supervisors Charl Ras and Sanming Zhou.

References

Andersen, P. J. and Ras, C. J., ‘Minimum bottleneck spanning trees with degree bounds’, Networks 68(4) (2016), 302–314.Google Scholar
Andersen, P. J. and Ras, C. J., ‘Algorithms for Euclidean degree bounded spanning tree problems’, Internat. J. Comput. Geom. Appl. 29(2) (2019), 121–160.Google Scholar
Andersen, P. J. and Ras, C. J., ‘Degree bounded bottleneck spanning trees in three dimensions’, Preprint, 2018, arXiv:1812.11177.Google Scholar