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

Cited in

(only showing first 100 items - show all)

A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
Center location problems on tree graphs with subtree-shaped customers
A fast algorithm for the alpha-connected two-center decision problem
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Up- and downgrading the 1-center in a network
A linear programming approach to highly precise clock synchronization over a packet network
Optimal algorithms for the path/tree-shaped facility location problems in trees
Computing circular separability
Geometric complexity of some location problems
Minimum polygonal separation
Linear programming in ${\mathbb{R}}^ 3$ and the skeleton and largest incircle of a convex polygon
A new O(n \,n) algorithm for computing the intersection of convex polygons
On the detection of a common intersection of k convex subjects in the plane
A linear-time algorithm for linear $L_ 1$ approximation of points
On the complexity of polyhedral separability
Small-dimensional linear programming and convex hulls made easy
A linear algorithm for bisecting a polygon
Finding effective ``Force targets for two-dimensional, multifinger frictional grips
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
Two scheduling problems with fuzzy due-dates
The slab dividing approach to solve the Euclidean $P$-center problem
Stabbing isothetic boxes and rectangles in $O(n\log n)$ time
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under $l_ \infty$-distance
Seven fingers allow force-torque closure grasps on any convex polyhedron
On the ball spanned by balls
K-center and K-median problems in graded distances
Generalized p-center problems: Complexity results and approximation algorithms
Locational optimization problems solved through Voronoi diagrams
Special issue on Locational analysis
Location of rectilinear center trajectories
Geometric methods to solve max-ordering location problems
Restricted center problems under polyhedral gauges
A geometrical solution for quadratic bicriteria location models
A comment on a minmax location problem
Locating service centers with precedence constraints
The complexity of finding minimal Voronoi covers with applications to machine learning
A deep cut ellipsoid algorithm for convex programming: Theory and applications
A sweepline algorithm to solve the two-center problem
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
Computing the smallest k-enclosing circle and related problems
Extremal polygon containment problems
Optimal algorithms for some intersection radius problems
k-violation linear programming
Helly-type theorems and generalized linear programming
Computing a centerpoint of a finite planar set of points in linear time
On the complexity of some basic problems in computational convexity. I. Containment problems
A bird's eye-view of min-max and max-min functionals
A note on center problems with forbidden polyhedra
Improved algorithms for several network location problems with equality measures.
Continuous location of dimensional structures.
Sorting weighted distances with applications to objective function evaluations in single facility location problems.
Algorithms for the robust 1-center problem on a tree
A note on the location of an obnoxious facility on a network
The geodesic 2-center problem in a simple polygon
The mixed center location problem
A generalization of the concept of distance based on the simplex inequality
Extensive facility location problems on networks: an updated review
The multi-service center problem
The connected disk covering problem
k-balanced center location problem: a new multi-objective facility location problem
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
Efficient algorithms for the smallest enclosing ball problem
A note on computing the center of uncertain data on the real line
Constructing the convex hull of a partially sorted set of points
On the recognition of digital circles in linear time
Group centre and group median of a tree
Congruence, similarity, and symmetries of geometric objects
A randomized algorithm for fixed-dimensional linear programming
On computing the closest boundary point on the convex hull
An elementary algorithm for digital arc segmentation
Efficient algorithm for transversal of disjoint convex polygons.
Transversal of disjoint convex polygons.
Competitive facility location: the Voronoi game
Separability by two lines and by nearly straight polygonal chains
A new bound and an $O(mn)$ algorithm for the undesirable 1-median problem (maxian) on networks
Fuzzy disk for covering fuzzy points
Dynamic half-space range reporting and its applications
Optimal separable partitioning in the plane
Efficient piecewise-linear function approximation using the uniform metric
Point location in zones of $k$-flats in arrangements
Solution of an equiweighted minimax location problem on a hemisphere
$\varepsilon$-approximation minimization of convex functions in fixed dimension
$\alpha$-kernel problem with fuzzy visibility
A subexponential bound for linear programming
Determining digital circularity using integer intervals
A dual algorithm for the minimum covering weighted ball problem in ${\mathbb{R}^n}$
Some variations on constrained minimum enclosing circle problem
A linear time algorithm for the robust recoverable selection problem
Chebyshev center of the intersection of balls: complexity, relaxation and approximation
Inverse group 1-median problem on trees
An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
The weighted $k$-center problem in trees for fixed $k$
On the planar two-center problem and circular hulls
The generalized trust region subproblem: solution complexity and convex hull results
Rearranging a sequence of points onto a line
Optimal conditions for connectedness of discretized sets
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
An efficient algorithm for the proximity connected two center problem
Bipartite diameter and other measures under translation

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)