Minimizing query frequency to bound congestion potential for moving entities at a fixed target time

DOI10.1007/978-3-031-43587-4_12MaRDI QIDQ6546591

William S. Evans, David G. Kirkpatrick

Publication date: 29 May 2024

zbMATH Keywords

competitive analysisonline algorithmscollision avoidanceuncertain inputsdata in motion

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Minimizing Co-location Potential of Moving Entities
• Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
• Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
• Data Structures for Mobile Data
• Kinetic 2-centers in the black-box model
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Minimizing Interference Potential Among Moving Entities

This page was built for publication: Minimizing query frequency to bound congestion potential for moving entities at a fixed target time