0370314 - MÚ 2012 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří - Jeż, Łukasz
Better bounds for incremental frequency allocation in bipartite graphs.
Algorithms - ESA 2011. Berlin: Springer, 2011 - (Demetrescu, C.; Halldórsson, M.), s. 251-262. Lecture Notes in Computer Science, 6942. ISBN 978-3-642-23718-8.
[19th Annual European Symposium. Saarbrücken (DE), 05.09.2011-09.09.2011]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : asymptotic competitive ratio * bipartite graphs * different frequency
Subject RIV: BA - General Mathematics
Result website:
http://www.springerlink.com/content/h25t5313l2u32n62/DOI: https://doi.org/10.1007/978-3-642-23719-5_22

We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain number of requests, and each of those requests must be assigned a different frequency. Edges represent conflicts between cells, meaning that frequencies in adjacent vertices must be different as well. The objective is to minimize the total number of used frequencies.
Permanent Link: http://hdl.handle.net/11104/0204153