Pages that link to "Item:Q3778541"
From MaRDI portal
The following pages link to Linear Programming in Linear Time When the Dimension Is Fixed (Q3778541):
Displaying 50 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- On detecting spatial regularity in noisy images (Q294654) (← links)
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Distributed predictive control with minimization of mutual disturbances (Q510082) (← links)
- Opaque sets (Q517796) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Weighted search in the plane (Q673472) (← links)
- An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles (Q673760) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
- A fast deterministic smallest enclosing disk approximation algorithm (Q835047) (← links)
- Digital planarity -- a review (Q869568) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Multi-dimensional dynamic facility location and fast computation at query points (Q976128) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- The \(C^m\) norm of a function with prescribed jets. II (Q1017346) (← links)
- Computing circular separability (Q1079817) (← links)
- Finding transversals for sets of simple geometric figures (Q1083215) (← links)
- Layout of facilities with some fixed points (Q1086124) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- A linear-time algorithm for linear \(L_ 1\) approximation of points (Q1115605) (← links)
- On the complexity of polyhedral separability (Q1119020) (← links)
- Convex hulls of samples from spherically symmetric distributions (Q1175782) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- Quantitative Steinitz's theorems with applications to multifingered grasping (Q1182994) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
