scientific article; zbMATH DE number 7826443
From MaRDI portal
Publication:6124757
DOI10.57717/cgt.v3i1.20MaRDI QIDQ6124757
Dominik Krupke, Phillip Keldenich, Sándor P. Fekete, Eike Niehs
Publication date: 2 April 2024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- A space efficient greedy triangulation algorithm
- There are planar graphs almost as good as the complete graph
- On simple polygonalizations with optimal area
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- Good triangulations yield good tours
- Angle-restricted tours in the plane.
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Discrete optimization methods to determine trajectories for Dubins' vehicles
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations
- Geometric Spanner Networks
- Minimum-weight triangulation is NP-hard
- On Generalized Diamond Spanners
- On the convex layers of a planar set
- Strong Connectivity in Directional Nearest-Neighbor Graphs
- TSPLIB—A Traveling Salesman Problem Library
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- The Angular-Metric Traveling Salesman Problem
- Traveling Salesperson Problems for the Dubins Vehicle
- Minimum Scan Cover with Angular Transition Costs
- 2-Opt Moves and Flips for Area-optimal Polygonizations
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons
- Area Optimal Polygonization Using Simulated Annealing
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019
- Computing Area-Optimal Simple Polygonizations
- Triangle-Based Heuristics for Area Optimal Polygonizations
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
- Improved upper bound on the stretch factor of delaunay triangulations
- Experimental study of geometric t -spanners
- Optimal Covering Tours with Turn Costs
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- Computing nonsimple polygons of minimum perimeter
- Lower Bounds on the Dilation of Plane Spanners
- Optimal Area Polygonization by Triangulation and Visibility Search
This page was built for publication:
