Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100656" target="_blank" >RIV/00216208:11320/11:10100656 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/11:00370314
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
19th Annual European Symposium on Algorithms
ISBN
978-3-642-23718-8
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
251-262
Publisher name
Springer
Place of publication
Berlin
Event location
Saarbrucken
Event date
Sep 5, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—