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.
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- A continuous strategy for collisionless gathering (Q2220827) (← links)
- Adaptive shape diagrams for multiscale morphometrical image analysis (Q2251256) (← links)
- Fast circular arc segmentation based on approximate circularity and cuboid graph (Q2251258) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Linear updates for a single-phase projective method (Q2276876) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- A combinatorial algorithm for the ordered 1-median problem on cactus graphs (Q2329555) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- Isotonic regression for multiple independent variables (Q2346967) (← links)
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points (Q2350591) (← links)
- Separability of imprecise points (Q2362104) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Splitting a configuration in a simplex (Q2366245) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach (Q2422768) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Strict \(L_{\infty }\) isotonic regression (Q2429415) (← links)
- Fuzzy facility location problem with preference of candidate sites (Q2455534) (← links)
- An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- New approaches to the robust 1-center location problems on tree networks (Q2678831) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Robust location problems with pos/neg weights on a tree (Q2748385) (← links)
- CONSTRAINED OPTIMAL LOCATION (Q2748922) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- Rectilinear <i>m</i> -Center problem (Q3035110) (← links)
- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point (Q3078388) (← links)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
- The (1|1)-Centroid Problem in the Plane with Distance Constraints (Q3177899) (← links)
