Geometric complexity of some location problems
From MaRDI portal
Publication:1099951
DOI10.1007/BF01840442zbMath0639.68038OpenAlexW1998932824MaRDI QIDQ1099951
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840442
Related Items
Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications ⋮ Heuristics for parallel machine scheduling with delivery times ⋮ SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS ⋮ PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS ⋮ The (1|1)-Centroid Problem in the Plane with Distance Constraints ⋮ On the planar piecewise quadratic 1-center problem ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ \(k\) best cuts for circular-arc graphs ⋮ On finding widest empty curved corridors ⋮ Obtaining lower bounds using artificial components ⋮ Processing an Offline Insertion-Query Sequence with Applications ⋮ The maximin line problem with regional demand ⋮ Minimum-area enclosing triangle with a fixed angle ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ On fixed-parameter solvability of the minimax path location problem ⋮ On the 2-Center Problem Under Convex Polyhedral Distance Function ⋮ The class cover problem with boxes ⋮ A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center ⋮ The \(p\)-center problem under locational uncertainty of demand points ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ Continuous location of dimensional structures. ⋮ Computing an obnoxious anchored segment. ⋮ OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM ⋮ Linear approximation of simple objects ⋮ Sorting weighted distances with applications to objective function evaluations in single facility location problems. ⋮ LABELING POINTS ON A SINGLE LINE ⋮ Computing the minimum Hausdorff distance between two point sets on a line under translation ⋮ Linear approximation of simple objects ⋮ One-dimensional \(k\)-center on uncertain data ⋮ New algorithms for facility location problems on the real line ⋮ An efficient parallel sorting algorithm ⋮ Bichromatic 2-center of pairs of points ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Locating an obnoxious plane ⋮ 2-Covered paths by a set of antennas with minimum power transmission range ⋮ Linear approximation of simple objects ⋮ Minimum perimeter-sum partitions in the plane ⋮ A near-linear algorithm for the planar segment-center problem ⋮ Locational optimization problems solved through Voronoi diagrams ⋮ On computing the closest boundary point on the convex hull ⋮ Median hyperplanes in normed spaces -- a survey ⋮ Special issue on Locational analysis ⋮ Location of rectilinear center trajectories ⋮ Facility location problems in the plane based on reverse nearest neighbor queries ⋮ Solving restricted line location problems via a dual interpretation ⋮ Conditional Location Problems on Networks and in the Plane ⋮ A comment on a minmax location problem ⋮ COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
Cites Work
- Unnamed Item
- Linear facility location. Solving extensions of the basic problem
- On the complexity of computations under varying sets of primitives
- On the complexity of locating linear facilities in the plane
- An efficient algorithm for determining the convex hull of a finite planar set
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Optimal Point Location in a Monotone Subdivision
- The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
- A Note on Locating a Set of Points in a Planar Subdivision
- Optimal Search in Planar Subdivisions
- Convex hulls of finite sets of points in two and three dimensions
- On the complexity of computing the measure of ∪[a i ,b i ]
- On the Optimality of Some Set Algorithms
