Minimum covering with travel cost
From MaRDI portal
Publication:454247
DOI10.1007/s10878-010-9303-0zbMath1254.90189arXiv1101.2360MaRDI QIDQ454247
Christiane Schmidt, Sándor P. Fekete, Joseph S. B. Mitchell
Publication date: 1 October 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.2360
covering; approximation algorithm; PTAS; bicriteria problems; lawn mowing; limited visibility; minimum Watchman problem
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest watchman routes in simple polygons
- Guarding galleries and terrains
- Polygon exploration with time-discrete vision
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Optimum watchman routes
- Approximation algorithms for lawn mowing and milling
- Über dichteste Kreislagerung und dünnste Kreisüberdeckung
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
- Minimum Covering with Travel Cost
- Approximation schemes for covering and packing problems in image processing and VLSI
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Approximation algorithms for TSP with neighborhoods in the plane
- Hamilton Paths in Grid Graphs
- Exact solutions and bounds for general art gallery problems
- Approximation of geometric dispersion problems
