Pages that link to "Item:Q1837617"
From MaRDI portal
The following pages link to On the complexity of locating linear facilities in the plane (Q1837617):
Displaying 50 items.
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning (Q643804) (← links)
- Combinatorial optimization problems related to the committee polyhedral separability of finite sets (Q735652) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- On the complexity of polyhedral separability (Q1119020) (← links)
- Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- Special issue on Locational analysis (Q1284594) (← links)
- Location of rectilinear center trajectories (Q1284595) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- Online exploration outside a convex obstacle (Q2166745) (← links)
- Soft computing methods for multiobjective location of garbage accumulation points in smart cities (Q2294596) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Minmax-distance approximation and separation problems: geometrical properties (Q2429461) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (Q2636610) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- Unique Covering Problems with Geometric Sets (Q3196414) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem (Q3627678) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
- APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS (Q4652928) (← links)
- Hitting and Piercing Rectangles Induced by a Point Set (Q4925240) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
- The two-line center problem from a polar view: a new algorithm and data structure (Q5057418) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS (Q5247061) (← links)
- Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- Traversing a set of points with a minimum number of turns (Q5901749) (← links)
- On a minimum linear classification problem (Q5920647) (← links)
- The role of optimization in some recent advances in data-driven decision-making (Q6044973) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
