
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kyungshik Lim, YannHang Lee, "Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks," IEEE Transactions on Computers, vol. 46, no. 3, pp. 312325, March, 1997.  
BibTex  x  
@article{ 10.1109/12.580427, author = {Kyungshik Lim and YannHang Lee}, title = {Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {3}, issn = {00189340}, year = {1997}, pages = {312325}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.580427}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks IS  3 SN  00189340 SP312 EP325 EPD  312325 A1  Kyungshik Lim, A1  YannHang Lee, PY  1997 KW  Optimal partition KW  dynamic programming KW  heuristics KW  highway cellular system KW  hexagonal cellular system KW  mobile communications network. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—Given
For highway cellular systems, we have designed an efficient optimal partitioning algorithm of
[1] B. Awerbuch and D. Peleg, “Concurrent Online Tracking of Mobile Users,” SIGCOM Symp. Communication Architectures and Protocols, Oct. 1991.
[2] B. Awerbuch and D. Peleg, "Sparse Partitions," Proc. 1990 IEEE 31th Ann. Symp. Foundations of Computer Science, pp. 503513, 1990.
[3] B.S. Baker, "Approximation Algorithms for NPComplete Problems on Planar Graphs," Proc. Symp. Foundation of Computer Science, pp. 265273, 1983.
[4] A. BarNoy and I. Kessler, "Tracking Mobile Users in Wireless Communications Networks," Proc. INFOCOM '93, pp. 1,2321,239, 1993.
[5] T.N. Bui and A. Peck, "Partitioning Planar Graphs," SIAM J. Computing, vol. 21, no. 2, pp. 203215, 1992.
[6] T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser, "Graph Bisection Algorithms with Good Average Case Behavior," Combinatorica, vol. 7, no. 2, pp. 171191, 1987.
[7] L. Caccetta, "Graph Theory in Network Design and Analysis," Recent Studies in Graph Theory, V. R. Kulli, ed. Vishwa Int'l, 1989.
[8] E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis, “The Complexity of Multiway Cuts,” ACM Symp. Theory of Computing, pp. 241251, 1992.
[9] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[10] O. Goldschmidt and D.S. Hochbaum, "Polynomial Algorithm for the kCut Problem," Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 444451, 1988.
[11] T. Imielinski and B.R. Badrinath, "Querying Locations in Wireless Environments," Proc. Third Workshop Third Generation Wireless Information Networks, Apr. 1992.
[12] B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partition Graphs," Bell System Technology, vol. 49, pp. 291307, 1970.
[13] S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, pp. 671680, 1993.
[14] E. Minieka, Optimization Algorithms for Networks and Graphs. Marcel Dekker, 1978.