An improved bound for plane covering paths
From MaRDI portal
Cites work
- A combinatorial problem in geometry.
- Angle-restricted tours in the plane.
- Covering a Set of Points with a Minimum Number of Lines
- COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
- Covering paths and trees for planar grids
- Covering paths for planar point sets
- Covering things with things
- Edge-removal and non-crossing configurations in geometric graphs
- Euclidean bottleneck bounded-degree spanning tree ratios
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
- scientific article; zbMATH DE number 1947430 (Why is no real title available?)
- scientific article; zbMATH DE number 1757971 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 6472595 (Why is no real title available?)
- scientific article; zbMATH DE number 6472596 (Why is no real title available?)
- Improved bounds for covering paths and trees in the plane
- Improved bounds for covering paths and trees in the plane
- Minimum-link watchman tours
- Noncrossing Hamiltonian paths in geometric graphs
- On Covering Points with Minimum Turns
- On polygons excluding point sets
- On the Maximum Scatter Traveling Salesperson Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Rainbow polygons for colored point sets in the plane
- The Angular-Metric Traveling Salesman Problem
- The Euclidean traveling salesman problem is NP-complete
- Traversing a set of points with a minimum number of turns
- Traversing a set of points with a minimum number of turns
This page was built for publication: An improved bound for plane covering paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322482)
