An exact algorithm for the minimum dilation triangulation problem
type: Item
instance of: scholarly article
title: An exact algorithm for the minimum dilation triangulation problem
zbMATH Open document ID: 1381.90092
author: Sattar Sattari
author: Mohammad Izadi
published in: Journal of Global Optimization
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6804404
zbMATH Keywords: triangulation
zbMATH Keywords: dilation
zbMATH Keywords: branch and bound
describes a project that uses: CGAL
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s10898-017-0517-x
OpenAlex ID: W2605639086
cites work: Q5369527
cites work: Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
cites work: Computing a minimum-dilation spanning tree is NP-hard
cites work: The computational geometry algorithms library CGAL
cites work: There are planar graphs almost as good as the complete graph
cites work: Delaunay graphs are almost as good as complete graphs
cites work: Lower Bounds on the Dilation of Plane Spanners
cites work: Q4945509
cites work: COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD
cites work: Q4028874
cites work: A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Geometric Spanner Networks
cites work: On degrees in random triangulations of point sets
cites work: On stable line segments in all triangulations of a planar point set
cites work: The stretch factor of the Delaunay triangulation is less than 1.998
DOI: 10.1007/S10898-017-0517-X
description: scientific article; zbMATH DE number 6804404