Line Segment Facility Location in Weighted Subdivisions
From MaRDI portal
Publication:3638446
DOI10.1007/978-3-642-02158-9_10zbMath1246.90081OpenAlexW1887596717MaRDI QIDQ3638446
Publication date: 2 July 2009
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_10
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Cites Work
- A linear-time algorithm for linear \(L_ 1\) approximation of points
- Computing optimal beams in two and three dimensions
- Approximation algorithms for geometric shortest path problems
- Line Facility Location in Weighted Regions
- Determining approximate shortest paths on weighted polyhedral surfaces
- Querying approximate shortest paths in anisotropic regions
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- Approximate Shortest Paths in Anisotropic Regions
- Finding Least-Distances Lines
- The weighted region problem
- Cooperative facility location games
- On finding approximate optimal paths in weighted regions
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- Determining an optimal penetration among weighted regions in two and three dimensions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Line Segment Facility Location in Weighted Subdivisions