Three results on frequency assignment in linear cellular networks

0353479 - MÚ 2011 RIV NL eng J - Journal Article
Chrobak, M. - Sgall, Jiří
Three results on frequency assignment in linear cellular networks.
Theoretical Computer Science. Roč. 411, č. 1 (2010), s. 131-137. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Keywords : frequency assignment * approximation algorithms * online algorithms
Subject RIV: BA - General Mathematics
Impact factor: 0.838, year: 2010
http://www.sciencedirect.com/science/article/pii/S0304397509006574

In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request has two more attributes: its arrival and departure times, and it is considered active from the time of arrival to the time of departure. We want to assign frequencies to all requests so that at each time step any two active requests associated with the same or adjacent vertices use different frequencies. The objective is to minimize the number of frequencies used.
Permanent Link: http://hdl.handle.net/11104/0192723