Greedy algorithms for tracking mobile users in special mobility graphs

DOI10.1016/S0166-218X(01)00238-4MaRDI QIDQ1613403zbMATH OpenFDO

Authors R. Smith, Stephan Olariu, Maria Cristina Pinotti, L. Wilson

Publication date 29 August 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(01)00238-4

zbMATH Keywords

interval graphstracking problemwireless networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tracking mobile users in wireless communications networks
• Tracking mobile users in cellular networks using timing information
• Structural Information and Communication Complexity
• User Tracking and Mobility Management Algorithm for Wireless Networks
• The conference call search problem in wireless networks

Cites work

• An optimal greedy heuristic to color interval graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Optimal greedy algorithms for indifference graphs
• Tracking mobile users in wireless communications networks

Cited in

(3)

• Tracking mobile users in wireless communications networks
• SmartMoveX on a graph -- an inexpensive active badge tracker
• Dynamic Multidimensional Scaling for Low-Complexity Mobile Network Tracking

Describes a project that uses

Uses Software

• LeZi-update

This page was built for publication: Greedy algorithms for tracking mobile users in special mobility graphs

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