Building bridges between convex regions

DOI10.1016/S0925-7721(02)00135-9zbMath1022.52003MaRDI QIDQ1873160

Chan-Su Shin, Hee-Kap Ahn, Otfried Schwarzkopf

Publication date: 19 May 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmEuclidean TSPTSP with neighborhoodstraveling salesman and buyers problem

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the optimal bridge between two convex polygons
• Approximation algorithms for the Geometric Covering Salesman Problem
• On computing the optimal bridge between two convex polygons.
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• On optimal bridges between two convex regions
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Minimum Diameter Spanning Trees and Related Problems
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Minimax parametric optimization problems and multi-dimensional parametric searching
• Computing the optimal bridge between two polygons