Results

**1 - 3**of**3**### Tight lower bound for the channel assignment problem

"... We study the complexity of theChannel Assignment problem. A major open problem asks whether Channel Assignment admits an O(cn)-time algorithm, for a constant c independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no 2o(n logn)-time algorithm sol ..."

Abstract
- Add to MetaCart

We study the complexity of theChannel Assignment problem. A major open problem asks whether Channel Assignment admits an O(cn)-time algorithm, for a constant c independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no 2o(n logn)-time algorithm solving Channel Assignment unless the Exponential Time Hypothesis fails. Note that the currently best known algorithm works in timeO∗(n!) = 2O(n logn) so our lower bound is tight. ∗E-mail:

### An Exact Algorithm for the Generalized List T-Coloring Problem

, 2013

"... The generalized list T-coloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)-labeling, channel assignment and T-coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We a ..."

Abstract
- Add to MetaCart

(Show Context)
The generalized list T-coloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)-labeling, channel assignment and T-coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We ask for a labeling of vertices of the input graph with natural numbers, in which every vertex gets a label from its list of permitted labels and the difference of labels of the endpoints of each edge does not belong to the set of forbidden differences of this edge. In this paper we present an exact algorithm solving this problem, running in time O∗((τ + 2)n), where τ is the maximum forbidden difference over all edges of the input graph and n is the number of its vertices. Moreover, we show how to improve this bound if the input graph has some special structure, e.g. a bounded maximum degree, no big induced stars or a perfect matching.