Počet záznamů: 1

Three results on frequency assignment in linear cellular networks

  1. 1.
    0338986 - MU-W 2010 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
    Chrobak, M. - Sgall, Jiří
    Three results on frequency assignment in linear cellular networks.
    Algorithmic Aspects in Information and Management. Berlin: Springer, 2009 - (Goldbert, A.; Zhou, Y.), s. 129-139. Lecture Notes in Computer Science, 5564. ISBN 978-3-642-02157-2.
    [5th International Conference on Algorithmic Aspects in Information and Management. San Francisco (US), 15.06.2009-17.06.2009]
    Grant CEP: GA MŠk(CZ) 1M0545; GA AV ČR IAA100190902
    Klíčová slova: frequency assignment * approximation algorithms * online algorithms
    Kód oboru RIV: IN - Informatika

    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 any time no two active requests associated with the same or adjacent nodes use the same frequency. The objective is to minimize the number of frequencies used.
    Trvalý link: http://hdl.handle.net/11104/0182622
    Název souboruStaženoVelikostKomentářVerzePřístup
    Sgall2.pdf1192.9 KBAutorský postprintpovolen