Linear-Time Algorithms for Linear Programming in R^3 and Related Problems

Cited in

(only showing first 100 items - show all)

Deterministic geoleader election in disoriented anonymous systems
Continuous center problems
Computing the smallest k-enclosing circle and related problems
Improved algorithms for the bichromatic two-center problem for pairs of points
Geometric p-center problems with centers constrained to two lines
Computation of inverse 1-center location problem on the weighted trapezoid graphs
A linear time algorithm for the robust recoverable selection problem
Rendezvous in planar environments with obstacles and unknown initial distance
Transversal of disjoint convex polygons.
Dynamic Trees and Dynamic Point Location
Measure of circularity for parts of digital boundaries and its fast computation
A linear-time algorithm for the center problem in weighted cycle graphs
A comment on a minmax location problem
Minimum enclosing circle of a set of fixed points and a mobile point
The double pivot simplex method
A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
k-balanced center location problem: a new multi-objective facility location problem
Improved algorithms for several network location problems with equality measures.
Two-variable linear programming in parallel
Sorting weighted distances with applications to objective function evaluations in single facility location problems.
VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
Optimal separable partitioning in the plane
Linear time algorithms for Euclidean 1-center in $\mathfrak {R}^d$ with non-linear convex constraints
Minimum polygonal separation
Linear time algorithms for Euclidean 1-center in $\mathfrak {R}^d$ with non-linear convex constraints
Using enclosing ellipsoids in multiaxial fatigue strength criteria
Rectilinear m -Center problem
The backup 2‐center and backup 2‐median problems on trees
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
Bichromatic 2-center of pairs of points
Connected matchings
Some variations on constrained minimum enclosing circle problem
A combinatorial algorithm for the ordered 1-median problem on cactus graphs
Computing the Smallest T-Shaped Polygon Containing k Points
Geometric methods to solve max-ordering location problems
Largest bounding box, smallest diameter, and related problems on imprecise points
An efficient algorithm for the smallest enclosing ball problem in high dimensions
A randomized algorithm for fixed-dimensional linear programming
Collection depots facility location problems in trees
Locating service centers with precedence constraints
A new O(n \,n) algorithm for computing the intersection of convex polygons
Geometric complexity of some location problems
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Optimizing squares covering a set of points
Robustness in the Pareto-solutions for the multi-criteria minisum location problem
Finding effective ``Force targets for two-dimensional, multifinger frictional grips
Extremal polygon containment problems
Covering convex polygons by two congruent disks
SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
Location of rectilinear center trajectories
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Inverse group 1-median problem on trees
Dynamic half-space range reporting and its applications
Efficient algorithms for the one-dimensional $k$-center problem
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
Robust location problems with pos/neg weights on a tree
A combinatorial bound for linear programming and related problems
CONSTRAINED OPTIMAL LOCATION
Digital straightness, circularity, and their applications to image analysis
Inverse eccentric vertex problem on networks
Computing the smallest k-enclosing circle and related problems
Line search method for solving a non-preemptive strictly periodic scheduling problem
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
Constructing the convex hull of a partially sorted set of points
Cooperative TSP
Two scheduling problems with fuzzy due-dates
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
Extensive facility location problems on networks: an updated review
The connected k-vertex one-center problem on graphs
scientific article; zbMATH DE number 7559117 (Why is no real title available?)
K-center and K-median problems in graded distances
Separability by two lines and by nearly straight polygonal chains
On the recognition of digital circles in linear time
A continuous strategy for collisionless gathering
A linear-time algorithm for linear $L_ 1$ approximation of points
An elementary algorithm for digital arc segmentation
The mixed center location problem
A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
Locational optimization problems solved through Voronoi diagrams
Fuzzy versions of the covering circle problem
Algorithms for weak and wide separation of sets
A deep cut ellipsoid algorithm for convex programming: Theory and applications
A sub-quadratic time algorithm for computing the beacon kernel of simple polygons
Base station placement on boundary of a convex polygon
Point set distance and orthogonal range problems with dependent geometric uncertainties
A new bound and an $O(mn)$ algorithm for the undesirable 1-median problem (maxian) on networks
Filling polyhedral molds
Special issue on Locational analysis
Center location problems on tree graphs with subtree-shaped customers
An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
Isotonic regression for multiple independent variables
A structured methodology for designing distributed algorithms for mobile entities
An optimal randomized algorithm for $d$-variate zonoid depth
Voronoi diagrams for a moderate-sized point-set in a simple polygon
Minmax regret 1-facility location on uncertain path networks
On the complexity of polyhedral separability
Computing the center of uncertain points on tree networks
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
Isoperimetric enclosures

This page was built for publication: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670553)