On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
From MaRDI portal
Publication:4720806
DOI10.1137/0215052zbMath0613.68044OpenAlexW2040783379MaRDI QIDQ4720806
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215052
location problemscomputational geometrylinear time algorithmsmultidimensional searchEuclidean one-centre problem
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computing methodologies and applications (68U99)
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, Building bridges between convex regions, Improved algorithms for the bichromatic two-center problem for pairs of points, Optimal algorithms for some intersection radius problems, Helly-type theorems and generalized linear programming, Solving Linear Programming with Constraints Unknown, Fuzzy disk for covering fuzzy points, On the planar piecewise quadratic 1-center problem, Separation and approximation of polyhedral objects, APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS, On the detection of a common intersection of k convex subjects in the plane, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, A subexponential bound for linear programming, Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints, A combinatorial bound for linear programming and related problems, On the 2-Center Problem Under Convex Polyhedral Distance Function, Decomposable multi-parameter matroid optimization problems., The \(p\)-center problem under locational uncertainty of demand points, Convex hulls of samples from spherically symmetric distributions, Small-dimensional linear programming and convex hulls made easy, Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function, One-dimensional \(k\)-center on uncertain data, Weighted search in the plane, New algorithms for facility location problems on the real line, CONSTRAINED OPTIMAL LOCATION, Two-variable linear programming in parallel, Transitions in geometric minimum spanning trees, Algorithms for weak and wide separation of sets, Linear time algorithms for some separable quadratic programming problems, A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes, Linear programming in \(O(n\times 3^{d^2})\) time, A simple linear algorithm for computing rectilinear 3-centers, Bichromatic 2-center of pairs of points, ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS, Multi-dimensional dynamic facility location and fast computation at query points, Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities, Facility location problems with uncertainty on the plane, Computing the geodesic center of a simple polygon, Fuzzy versions of the covering circle problem, Covering problems with polyellipsoids: a location analysis perspective, Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints, Two-variable linear programming in parallel, A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane, Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions, On the ball spanned by balls, K-center and K-median problems in graded distances, A simple heuristic for the p-centre problem, Characterizing multiterminal flow networks and computing flows in networks of small treewidth, A randomized algorithm for fixed-dimensional linear programming, Computing a geodesic two-center of points in a simple polygon, Continuous Center Problems, On the planar two-center problem and circular hulls, Application of decision analysis techniques to the Weber facility location problem
