Distributed Online Frequency Assignment in Cellular Networks
From MaRDI portal
Publication:4500850
DOI10.1006/jagm.1999.1068zbMath0957.68007MaRDI QIDQ4500850
Sunil M. Shende, Danny Krizanc, Lata Narayanan, Jeannette C. M. Janssen
Publication date: 22 November 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1068
68M10: Network design and communication in computer systems
Related Items
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs, Absolute and asymptotic bounds for online frequency allocation in cellular networks, Online multi-coloring on the path revisited, A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs], A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs, Simpler multicoloring of triangle-free hexagonal graphs, Greedy online frequency allocation in cellular networks, A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs, Deterministic broadcasting time with partial knowledge of the network., On-line algorithms for the channel assignment problem in cellular networks., Worst-case analysis of a dynamic channel assignment strategy, Distributive online channel assignment for hexagonal cellular networks with constraints, 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs, Online multi-coloring with advice, Optimal \(L(3, 2, 1)\)-labeling of triangular lattice, 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs, 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs, 2-local distributed algorithms for generalized coloring of hexagonal graphs, Online Multi-Coloring with Advice, Competitive algorithms and lower bounds for online randomized call control in cellular networks
