Pages that link to "Item:Q3670553"
From MaRDI portal
The following pages link to Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems (Q3670553):
Displaying 50 items.
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- The multi-service center problem (Q1680546) (← links)
- The connected disk covering problem (Q1702836) (← links)
- \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- A note on computing the center of uncertain data on the real line (Q1790197) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- On the recognition of digital circles in linear time (Q1803274) (← links)
- Group centre and group median of a tree (Q1804070) (← links)
- Congruence, similarity, and symmetries of geometric objects (Q1822962) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- An elementary algorithm for digital arc segmentation (Q1827813) (← links)
- Efficient algorithm for transversal of disjoint convex polygons. (Q1853055) (← links)
- Transversal of disjoint convex polygons. (Q1853175) (← links)
- Competitive facility location: the Voronoi game (Q1884986) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
- Fuzzy disk for covering fuzzy points (Q1887918) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Solution of an equiweighted minimax location problem on a hemisphere (Q1918921) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- Determining digital circularity using integer intervals (Q1932889) (← links)
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (Q1941021) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- A linear time algorithm for the robust recoverable selection problem (Q1983118) (← links)
- Chebyshev center of the intersection of balls: complexity, relaxation and approximation (Q2020607) (← links)
- Inverse group 1-median problem on trees (Q2031325) (← links)
- An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem (Q2031386) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Optimal conditions for connectedness of discretized sets (Q2156309) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults (Q2204778) (← links)
- Gathering by repulsion (Q2206731) (← links)
