UP - logo
Library of Technical Faculties, Maribor (KTFMB)
  • 2-local 7/6-competitive algorithm for multicoloring a sub-class of hexagonal graphs
    Šparl, Petra, 1975-2016 ; Žerovnik, Janez, 1958-
    An important optimization problem in the design of cellular networks is to assign sets of frequencies to transmitters to avoid unacceptable interference. A cellular network is generally modeled as a ... subgraph of the infinite triangular lattice. The distributed frequency assignment problem can be abstracted as a multicoloring problem on a weighted hexagonal graph, where the weight vector represents the number of calls to be assigned at vertices. In this paper we present a 2-local distributed algorithm for multicoloring triangle-free hexagonal graphs with no adjacent centers and with arbitrary demands. The algorithm is using only the local clique numbers at each vertex v of the given hexagonal graph, which can be computed from local information available at the vertex. We prove that the algorithm uses no more than ▫$\lcei7\omega(G)/6\rceil$▫ + 5 colors for any triangle-free hexagonal graph with no adjacent centers G, withouth explicitly computing the global clique number ▫$\omega(g)$▫. Hence the competitive ratio of the algorithm is 7/6.
    Source: Preprint series. - ISSN 1318-4865 (Vol. 43, 988, 2005, 16 str.)
    Type of material - article, component part
    Publish date - 2005
    Language - english
    COBISS.SI-ID - 9985302

source: Preprint series. - ISSN 1318-4865 (Vol. 43, 988, 2005, 16 str.)

loading ...
loading ...
loading ...