Local base station assignment with time intervals in mobile computing environments
type: Item
instance of: scholarly article
title: Local base station assignment with time intervals in mobile computing environments
zbMATH Open document ID: 1103.90393
DOI: 10.1016/S0377-2217(03)00190-5
author: Daniel J. Rosenkrantz
author: S. S. Ravi
author: Giri Kumar Tayi
published in: European Journal of Operational Research
publication date: 2004-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2091305
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Mobile systems
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
cites work: Q4252723
cites work: Q4230343
cites work: On-Line Load Balancing of Temporary Tasks
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Q3684121
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Online perfect matching and mobile computing
cites work: Q4002466
cites work: Matching theory
cites work: Q3818127
cites work: The many facets of linear programming
Recommended article: A new time-based algorithm for positioning mobile terminals in wireless networks
Recommended article: Distributed Computing – IWDC 2005
Recommended article: Q4375781
Recommended article: Scheduling solution for the IEEE 802.16 base station
Recommended article: Cellular channel assignment: A new localized and distributed strategy
Recommended article: Optimum and Equilibrium in Assignment Problems With Congestion: Mobile Terminals Association to Base Stations
Recommended article: Optimization of Base Stations Positioning in Mobile Networks
description: scientific article; zbMATH DE number 2091305