No label defined (Q6124757)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7826443

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7826443

Statements

scholarly article

0 references

Sándor P. Fekete

0 references

Phillip Keldenich

0 references

0 references

0 references

publication date

2 April 2024

0 references

zbMATH Keywords

edge sparsification

0 references

algorithm engineering

0 references

integer programming

0 references

tour problems

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Angular-Metric Traveling Salesman Problem

0 references

Optimal Covering Tours with Turn Costs

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations

0 references

On Generalized Diamond Spanners

0 references

On plane geometric spanners: a survey and open problems

0 references

A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields

0 references

An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs

0 references

On the convex layers of a planar set

0 references

There are planar graphs almost as good as the complete graph

0 references

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

0 references

Area-Optimal Simple Polygonalizations: The CG Challenge 2019

0 references

Lower Bounds on the Dilation of Plane Spanners

0 references

2-Opt Moves and Flips for Area-optimal Polygonizations

0 references

Experimental study of geometric <i>t</i> -spanners

0 references

On simple polygonalizations with optimal area

0 references

Computing nonsimple polygons of minimum perimeter

0 references

Computing Area-Optimal Simple Polygonizations

0 references

Minimum Scan Cover with Angular Transition Costs

0 references

Angle-restricted tours in the plane.

0 references

Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics

0 references

Strong Connectivity in Directional Nearest-Neighbor Graphs

0 references

A space efficient greedy triangulation algorithm

0 references

Area Optimal Polygonization Using Simulated Annealing

0 references

0 references

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

0 references

0 references

Optimal Area Polygonization by Triangulation and Visibility Search

0 references

Good triangulations yield good tours

0 references

The greedy triangulation can be computed from the Delaunay triangulation in linear time

0 references

0 references

Discrete optimization methods to determine trajectories for Dubins' vehicles

0 references

Minimum-weight triangulation is NP-hard

0 references

Geometric Spanner Networks

0 references

An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets

0 references

Triangle-Based Heuristics for Area Optimal Polygonizations

0 references

Traveling Salesperson Problems for the Dubins Vehicle

0 references

Geometric and LP-based heuristics for angular travelling salesman problems in the plane

0 references

Improved upper bound on the stretch factor of delaunay triangulations

0 references

Identifiers

10.57717/cgt.v3i1.20

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6124757

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6124757&oldid=37655546"