Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


Durham Research Online
You are in:

Radio labeling with preassigned frequencies.

Bodlaender, H. L. and Broersma, H. J. and Fomin, F. V. and Pyatkin, A. V. and Woeginger, G. J. (2004) 'Radio labeling with preassigned frequencies.', SIAM journal on optimization., 15 (1). pp. 1-16.

Abstract

A radio labeling of a graph G is an assignment of pairwise distinct, positive integer labels to the vertices of G such that labels of adjacent vertices differ by at least $2$. The radio labeling problem (RL) consists in determining a radio labeling that minimizes the maximum label that is used (the so-called span of the labeling). RL is a well-studied problem, mainly motivated by frequency assignment problems in which transmitters are not allowed to operate on the same frequency channel. We consider the special case where some of the transmitters have preassigned operating frequency channels. This leads to the natural variants p-RL(l) and p-RL(*) of RL with l preassigned labels and an arbitrary number of preassigned labels, respectively. We establish a number of combinatorial, algorithmical, and complexity-theoretical results for these variants of radio labeling. In particular, we investigate a simple upper bound on the minimum span, yielding a linear time approximation algorithm with a constant additive error bound for p-RL(*) restricted to graphs with girth at least 5. We consider the complexity of p-RL(l) and p-RL(*) for several cases in which RL is known to be polynomially solvable. On the negative side, we prove that p-RL(*) is NP-hard for cographs and for k-colorable graphs where a k-coloring is given (k at least 3). On the positive side, we derive polynomial time algorithms solving p-RL(*)} and p-RL(l) for graphs with bounded maximum degree, and for solving p-RL(l) for k-colorable graphs where a k-coloring is given.

Item Type:Article
Keywords:Radio labeling, Frequency assignment, Graph algorithms, Computational complexity, Approximation algorithm, Cograph, K-coloring.
Full text:PDF - Published Version (222Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1137/S1052623402410181
Publisher statement:©2004 Society for Industrial and Applied Mathematics
Record Created:07 Oct 2008
Last Modified:15 Jun 2011 16:52

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library