Greedy algorithms for tracking mobile users in special mobility graphs

DOI10.1016/S0166-218X(01)00238-4zbMATH Open1020.90008MaRDI QIDQ1613403FDOQ1613403

Authors: R. Smith 

Publication date: 29 August 2002

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

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

zbMATH Keywords

interval graphswireless networkstracking problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimal greedy algorithms for indifference graphs
• An optimal greedy heuristic to color interval graphs
• Tracking mobile users in wireless communications networks

Cited In (2)

• Title not available (Why is that?)
• Dynamic Multidimensional Scaling for Low-Complexity Mobile Network Tracking

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)