On-line algorithms for the channel assignment problem in cellular networks-Reference-Cited by-同舟云学术

On-line algorithms for the channel assignment problem in cellular networks

Published:2004-03 Issue:3 Volume:137 Page:237-266
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Crescenzi Pilu,Gambosi Giorgio,Penna Paolo

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference27 articles.

1. S. Albers, Better bounds for on-line scheduling, Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), 1997, pp. 130–139.

2. On-line load balancing;Azar,1998

3. Online load balancing;Azar;Theoret. Comput. Sci.,1994

4. Y. Azar, L. Epstein, On-line load balancing of temporary tasks on identical machines, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems (ISTCS), 1997, pp. 119–125.

5. Online load balancing of temporary tasks;Azar;J. Algorithms,1997

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bin stretching with migration on two hierarchical machines;Mathematical Methods of Operations Research;2023-07-19

2. Online scheduling with migration on two hierarchical machines;Journal of Combinatorial Optimization;2022-09-15

3. Total completion time minimization scheduling on two hierarchical uniform machines;Theoretical Computer Science;2017-11

4. Total completion time minimization in online hierarchical scheduling of unit-size jobs;Journal of Combinatorial Optimization;2016-03-26

5. Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes;Asia-Pacific Journal of Operational Research;2015-10