Constrained square-center problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 6472586 (Why is no real title available?)
- An Expander-Based Approach to Geometric Optimization
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Generalized Selection and Ranking: Sorted Matrices
- Intersection properties of boxes in \(R^ n\).
- Maintenance of configurations in the plane
- On piercing sets of axis-parallel rectangles and rings
- On some geometric selection and optimization problems via sorted matrices
- Optimal line bipartitions of point sets
- Parallel Merge Sort
- The two-line center problem from a polar view: a new algorithm and data structure
Cited in
(7)- Optimizing squares covering a set of points
- Optimizing squares covering a set of points
- Covering point sets with two disjoint disks or squares
- scientific article; zbMATH DE number 219276 (Why is no real title available?)
- Covering a set of points by two axis-parallel boxes
- Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares
- Constrained two-line center problems
This page was built for publication: Constrained square-center problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054846)
