Maximum box problem on stochastic points
DOI10.1007/s00453-021-00882-zzbMath1486.68208OpenAlexW3209196676MaRDI QIDQ5918465
Pablo Pérez-Lantero, Carlos Seara, Luis-Evaristo Caraballo, Inmaculada Ventura
Publication date: 18 January 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00882-z
Analysis of algorithms (68W40) Stochastic programming (90C15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Closest pair and the post office problem for stochastic points
- Matching colored points with rectangles
- The complexity of power-index comparison
- Removing degeneracies by perturbing the problem or perturbing the world
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- On the Most Likely Convex Hull of Uncertain Points
- Hyperplane separability and convexity of probabilistic point sets
- The Union of Probabilistic Boxes: Maintaining the Volume
- Bichromatic separability with two boxes: A general approach
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
- Monte-Carlo approximation algorithms for enumeration problems
- Universality considerations in VLSI circuits
- Allocating Bandwidth for Bursty Connections
- Computing the Expected Value and Variance of Geometric Measures
- Smallest enclosing ball for probabilistic data
- Stochastic minimum spanning trees in euclidean spaces
This page was built for publication: Maximum box problem on stochastic points
