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.
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints (Q3312019) (← links)
- Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand (Q3453339) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
- On the ‘most normal’ normal (Q3546179) (← links)
- A Modified Kolmogorov–Smirnov Test for Normality (Q3577193) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- Robustness in the Pareto-solutions for the multi-criteria minisum location problem (Q4329625) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- Minimum-diameter covering problems (Q4520238) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS (Q4818542) (← links)
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm (Q5040739) (← links)
- (Q5051496) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
- Distribution-sensitive algorithms (Q5054869) (← links)
- A Continuous Strategy for Collisionless Gathering (Q5056062) (← links)
- Filling polyhedral molds (Q5060114) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
- (Q5090454) (← links)
- (Q5092418) (← links)
- A combinatorial bound for linear programming and related problems (Q5096811) (← links)
- Gathering by Repulsion. (Q5116477) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
- Collection depots facility location problems in trees (Q5191128) (← links)
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS (Q5261016) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)
- REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS (Q5300004) (← links)
- POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES (Q5300009) (← links)
- RED-BLUE SEPARABILITY PROBLEMS IN 3D (Q5311632) (← links)
- Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle (Q5357503) (← links)
- Explicit Communication Among Stigmergic Robots (Q5384466) (← links)
- Continuous Center Problems (Q5506719) (← links)
- Discrete Center Problems (Q5506720) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots (Q5919063) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5919104) (← links)
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions (Q5919112) (← links)
