Local base station assignment with time intervals in mobile computing environments

DOI10.1016/S0377-2217(03)00190-5zbMath1103.90393MaRDI QIDQ1877045

S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimizationComputational complexityMobile systems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Covering moving points with anchored disks, OR and the management of electronic services, An efficient link allocation algorithm for survivable ATM-based personal communication networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Some simplified NP-complete graph problems
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• The many facets of linear programming
• On-Line Load Balancing of Temporary Tasks
• Online perfect matching and mobile computing