Frequency-competitive query strategies to maintain low congestion potential among moving entities

DOI10.1007/S00224-026-10263-0MaRDI QIDQ7233455zbMATH OpenFDO

Authors W. Evans, David Kirkpatrick

Publication date 27 April 2026

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-026-10263-0

zbMATH Keywords

collision avoidancecompetitive analysisdata in motiononline algorithmsuncertain inputs

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computing methodologies and applications (68Uxx) Algorithms in computer science (68Wxx)

Cites work

• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Data Structures for Mobile Data
• Delaunay triangulation of imprecise points in linear time after preprocessing
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 7075885 (Why is no real title available?)
• Kinetic 2-centers in the black-box model
• 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
• Minimizing co-location potential of moving entities
• Minimizing Interference Potential Among Moving Entities
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
• Pinwheel scheduling: Achievable densities
• The scheduling of maintenance service

This page was built for publication: Frequency-competitive query strategies to maintain low congestion potential among moving entities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233455)