scientific article
From MaRDI portal
Publication:3216469
zbMath0553.90103MaRDI QIDQ3216469
Jan van Leeuwen, Anneke A. Schoone
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesmanpolynomial timeapproximation algorithmsintersecting edgesintersection elimination algorithm
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Related Items (16)
A new algorithm for embedding plane graphs at fixed vertex locations ⋮ On triconnected and cubic plane graphs on given point sets ⋮ The Number of Flips Required to Obtain Non-crossing Convex Cycles ⋮ Use of simple polygonal chains in generating random simple polygons ⋮ Generating random polygons with given vertices ⋮ 2-Opt Moves and Flips for Area-optimal Polygonizations ⋮ The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP ⋮ Connecting polygonizations via stretches and twangs ⋮ Algorithm 966 ⋮ Untangled monotonic chains and adaptive range search ⋮ Fréchet distance between two point sets ⋮ Bounded-angle minimum spanning trees ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations.
This page was built for publication:
