Greedy algorithms for tracking mobile users in special mobility graphs

DOI10.1016/S0166-218X(01)00238-4zbMath1020.90008MaRDI QIDQ1613403

R. Smith

Publication date: 29 August 2002

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

zbMATH Keywords

interval graphstracking problemwireless networks

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)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• An optimal greedy heuristic to color interval graphs
• Optimal greedy algorithms for indifference graphs
• Tracking mobile users in wireless communications networks

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