7 research outputs found
10-Gabriel graphs are Hamiltonian
Given a set of points in the plane, the -Gabriel graph of is the
geometric graph with vertex set , where are connected by an
edge if and only if the closed disk having segment as diameter
contains at most points of . We consider the
following question: What is the minimum value of such that the -Gabriel
graph of every point set contains a Hamiltonian cycle? For this value, we
give an upper bound of 10 and a lower bound of 2. The best previously known
values were 15 and 1, respectively
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
AbstractIt is shown that it is an NP-complete problem to determine whether a Delaunay triangulation or an inscribable polyhedron has a Hamiltonian cycle. It is also shown that there exist nondegenerate Delaunay triangulations and simplicial, inscribable polyhedra without 2-factors
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
We consider an extension of the triangular-distance Delaunay graphs
(TD-Delaunay) on a set of points in the plane. In TD-Delaunay, the convex
distance is defined by a fixed-oriented equilateral triangle ,
and there is an edge between two points in if and only if there is an empty
homothet of having the two points on its boundary. We consider
higher-order triangular-distance Delaunay graphs, namely -TD, which contains
an edge between two points if the interior of the homothet of
having the two points on its boundary contains at most points of . We
consider the connectivity, Hamiltonicity and perfect-matching admissibility of
-TD. Finally we consider the problem of blocking the edges of -TD.Comment: 20 page
Recommended from our members
Discrete Geometry (hybrid meeting)
A number of important recent developments in various branches of
discrete geometry were presented at the workshop, which took place in
hybrid format due to a pandemic situation. The presentations
illustrated both the diversity of the area and its strong connections
to other fields of mathematics such as topology, combinatorics,
algebraic geometry or functional analysis. The open questions abound
and many of the results presented were obtained by young researchers,
confirming the great vitality of discrete geometry
The Traveling Salesman Problem
This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances. Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances