- Online Multi-Coloring with Advice.
- Marie G. Christ, Lene M. Favrholdt, and Kim S. Larsen.
Theoretical Computer Science, 596: 79-91, 2015.
We consider the problem of online graph multi-coloring with advice.
Multi-coloring is often used to model frequency allocation in
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.
- Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any):
The publication is available from ScienceDirect.
open access (250 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.
Other publications by the author.