Pages that link to "Item:Q4500850"
From MaRDI portal
The following pages link to Distributed Online Frequency Assignment in Cellular Networks (Q4500850):
Displaying 20 items.
- Online multi-coloring on the path revisited (Q378204) (← links)
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs (Q496697) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Greedy online frequency allocation in cellular networks (Q845962) (← links)
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- Worst-case analysis of a dynamic channel assignment strategy (Q1827841) (← links)
- Distributive online channel assignment for hexagonal cellular networks with constraints (Q1887044) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- Optimal \(L(3, 2, 1)\)-labeling of triangular lattice (Q2357158) (← links)
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258) (← links)
- 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs (Q2883583) (← links)
- 2-local distributed algorithms for generalized coloring of hexagonal graphs (Q3439359) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- Competitive algorithms and lower bounds for online randomized call control in cellular networks (Q3548724) (← links)
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs (Q5747734) (← links)
- Absolute and asymptotic bounds for online frequency allocation in cellular networks (Q5961981) (← links)