All-maximum and all-minimum problems under some measures
From MaRDI portal
Recommendations
- A minimax-measure intersection problem
- A measure-theoretical max-flow-min-cut problem
- A minimax lemma and its applications
- scientific article; zbMATH DE number 1127062
- Maximization problems and Lindenstrauss condition
- Min-max theory and the Willmore conjecture
- Min-max theory and a proof of the Willmore conjecture
- On the dimension of max-min convex sets
- Minimal and maximal solutions for Dirichlet pseudomonotone problems
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3289061 (Why is no real title available?)
- 2-point site Voronoi diagrams
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems
- A simple randomized sieve algorithm for the closest-pair problem
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Farthest line segment Voronoi diagrams
- Finding Extremal Polygons
- On a class of \(O(n^ 2)\) problems in computational geometry
- On ray shooting in convex polytopes
- On the Zone Theorem for Hyperplane Arrangements
- On the all-farthest-segments problem for a planar set of points
- Proximity problems on line segments spanned by points
- Selecting distances in arrangements of hyperplanes spanned by points.
- The power of geometric duality
- Topologically sweeping an arrangement
Cited in
(2)
This page was built for publication: All-maximum and all-minimum problems under some measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396657)
