Minimizing co-location potential of moving entities

DOI10.1137/15M1031217MaRDI QIDQ2829447zbMATH OpenOpenAlexFDO

Authors Maarten Löffler, Frank Staals, W. Evans, David Kirkpatrick

Publication date 28 October 2016

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/15m1031217

zbMATH Keywords

competitive analysisdata in motioninput impressionply

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Competitive query strategies for minimising the ply of the potential locations of moving points
• Minimizing Interference Potential Among Moving Entities
• Tracking moving objects with few handovers
• Kinetic facility location
• The Kinetic Facility Location Problem

Cites work

• A computational framework for incremental motion
• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
• A study on two geometric location problems
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Computing minimum spanning trees with uncertainty
• Deformable spanners and applications
• Efficient update strategies for geometric computing with uncertainty
• scientific article; zbMATH DE number 1303547 (Why is no real title available?)
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 7051280 (Why is no real title available?)
• scientific article; zbMATH DE number 2115093 (Why is no real title available?)
• Input-Thrifty Extrema Testing
• Kinetic connectivity for unit disks
• Kinetic convex hulls and Delaunay triangulations in the black-box model
• Largest and smallest convex hulls for imprecise points
• Maintaining Nets and Net Trees under Incremental Motion
• Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Separators for sphere-packings and nearest neighbor graphs
• Tracking moving objects with few handovers

Cited in

(4)

• Minimizing Interference Potential Among Moving Entities
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Frequency-competitive query strategies to maintain low congestion potential among moving entities

This page was built for publication: Minimizing co-location potential of moving entities

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