- Better bounds for incremental frequency allocation in bipartite graphs
Number of the records: 1  

Better bounds for incremental frequency allocation in bipartite graphs

  1. 1.
    SYSNO0370314
    TitleBetter bounds for incremental frequency allocation in bipartite graphs
    Author(s) Chrobak, M. (US)
    Sgall, Jiří (MU-W) RID, ORCID, SAI
    Jeż, Łukasz (MU-W) RID, SAI, ORCID
    Source Title Algorithms - ESA 2011. S. 251-262. - Berlin : Springer, 2011 / Demetrescu C. ; Halldórsson M.M.
    Conference 19th Annual European Symposium, Saarbrücken, 05.09.2011-09.09.2011
    Document TypeKonferenční příspěvek (zahraniční konf.)
    Grant IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryDE
    Keywords asymptotic competitive ratio * bipartite graphs * different frequency
    URLhttp://www.springerlink.com/content/h25t5313l2u32n62/
    Permanent Linkhttp://hdl.handle.net/11104/0204153
    FileDownloadSizeCommentaryVersionAccess
    Sgall.pdf1277.2 KBPublisher’s postprintrequire
     
Number of the records: 1  

Metadata are licenced under CC0

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.