Pages that link to "Item:Q845962"

The following pages link to Greedy online frequency allocation in cellular networks (Q845962):

Displaying 11 items.

• Better bounds for incremental frequency allocation in bipartite graphs (Q386900) (← links)
• Constant-competitive tree node assignment (Q391778) (← links)
• Online call control in cellular networks revisited (Q763482) (← links)
• A constant-competitive algorithm for online OVSF code assignment (Q848939) (← links)
• Deterministic on-line call control in cellular networks (Q982658) (← links)
• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
• Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
• Online data caching in edge-cloud collaborative system with the data center (Q2091103) (← links)
• Three Results on Frequency Assignment in Linear Cellular Networks (Q3638448) (← links)
• A Constant-Competitive Algorithm for Online OVSF Code Assignment (Q5387778) (← links)
• Absolute and asymptotic bounds for online frequency allocation in cellular networks (Q5961981) (← links)