Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
433830 | Theoretical Computer Science | 2015 | 13 Pages |
Abstract
We consider the problem of online graph multi-coloring with advice. Multi-coloring is often used to model frequency allocation in cellular networks. We give several nearly tight upper and lower bounds for the most standard topologies of cellular networks, paths and hexagonal graphs. For the path, negative results trivially carry over to bipartite graphs, and our positive results are also valid for bipartite graphs. For hexagonal graphs, negative results trivially carry over to 3-colorable graphs, and most of our positive results do as well. The advice given represents information that is likely to be available, studying for instance the data from earlier similar periods of time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen,