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.
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- Computing circular separability (Q1079817) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (Q1102184) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- On the detection of a common intersection of k convex subjects in the plane (Q1111021) (← links)
- A linear-time algorithm for linear \(L_ 1\) approximation of points (Q1115605) (← links)
- On the complexity of polyhedral separability (Q1119020) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- A linear algorithm for bisecting a polygon (Q1186591) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming (Q1194852) (← links)
- Two scheduling problems with fuzzy due-dates (Q1198861) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time (Q1208431) (← links)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- Seven fingers allow force-torque closure grasps on any convex polyhedron (Q1209736) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- Special issue on Locational analysis (Q1284594) (← links)
- Location of rectilinear center trajectories (Q1284595) (← links)
- Geometric methods to solve max-ordering location problems (Q1289016) (← links)
- Restricted center problems under polyhedral gauges (Q1291660) (← links)
- A geometrical solution for quadratic bicriteria location models (Q1296369) (← links)
- A comment on a minmax location problem (Q1306472) (← links)
- Locating service centers with precedence constraints (Q1314338) (← links)
- The complexity of finding minimal Voronoi covers with applications to machine learning (Q1314528) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Optimal algorithms for some intersection radius problems (Q1332347) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- Computing a centerpoint of a finite planar set of points in linear time (Q1338958) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- A bird's eye-view of min-max and max-min functionals (Q1362232) (← links)
- A note on center problems with forbidden polyhedra (Q1362521) (← links)
- Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- Algorithms for the robust 1-center problem on a tree (Q1569932) (← links)
- A note on the location of an obnoxious facility on a network (Q1579481) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- The mixed center location problem (Q1631666) (← links)
- A generalization of the concept of distance based on the simplex inequality (Q1646650) (← links)
