### Abstract

We establish a number of combinatorial, algorithmical, and complexitytheoretical 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 ≥ 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 ≥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.

Original language | English |
---|---|

Title of host publication | Algorithms — ESA 2002 |

Subtitle of host publication | 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings |

Editors | Ralf Möhring, Rajeev Raman |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 211-222 |

ISBN (Electronic) | 978-3-540-45749-7 |

ISBN (Print) | 978-3-540-44180-9 |

DOIs | |

Publication status | Published - 2002 |

Event | 10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy Duration: 17 Sep 2002 → 21 Sep 2002 Conference number: 10 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 2461 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 10th Annual European Symposium on Algorithms, ESA 2002 |
---|---|

Abbreviated title | ESA |

Country | Italy |

City | Rome |

Period | 17/09/02 → 21/09/02 |

### Fingerprint

### Keywords

- METIS-208179

### Cite this

*Algorithms — ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings*(pp. 211-222). (Lecture Notes in Computer Science; Vol. 2461). Berlin: Springer. https://doi.org/10.1007/3-540-45749-6_22

}

*Algorithms — ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings.*Lecture Notes in Computer Science, vol. 2461, Springer, Berlin, pp. 211-222, 10th Annual European Symposium on Algorithms, ESA 2002, Rome, Italy, 17/09/02. https://doi.org/10.1007/3-540-45749-6_22

**Radio Labeling with Pre-assigned Frequencies.** / Bodlaender, Hans L.; Broersma, Haitze J.; Fomin, Fedor V.; Pyatkin, Artem; Woeginger, Gerhard.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Radio Labeling with Pre-assigned Frequencies

AU - Bodlaender, Hans L.

AU - Broersma, Haitze J.

AU - Fomin, Fedor V.

AU - Pyatkin, Artem

AU - Woeginger, Gerhard

PY - 2002

Y1 - 2002

N2 - 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 pre-assigned labels and an arbitrary number of pre-assigned labels, respectively.We establish a number of combinatorial, algorithmical, and complexitytheoretical 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 ≥ 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 ≥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.

AB - 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 pre-assigned labels and an arbitrary number of pre-assigned labels, respectively.We establish a number of combinatorial, algorithmical, and complexitytheoretical 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 ≥ 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 ≥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.

KW - METIS-208179

U2 - 10.1007/3-540-45749-6_22

DO - 10.1007/3-540-45749-6_22

M3 - Conference contribution

SN - 978-3-540-44180-9

T3 - Lecture Notes in Computer Science

SP - 211

EP - 222

BT - Algorithms — ESA 2002

A2 - Möhring, Ralf

A2 - Raman, Rajeev

PB - Springer

CY - Berlin

ER -