Better bounds for incremental frequency allocation in bipartite graphs

DOI10.1016/J.TCS.2012.05.020zbMath1277.68023OpenAlexW2800868740MaRDI QIDQ386900

Marek Chrobak, Łukasz Jeż, Jiří Sgall

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.020

zbMATH Keywords

online algorithmsgraph algorithmsfrequency allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online Multi-Coloring with Advice ⋮ Online multi-coloring with advice

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Greedy online frequency allocation in cellular networks
• Three results on frequency assignment in linear cellular networks
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
• Channel assignment and weighted coloring
• Frequency Allocation Problems for Linear Cellular Networks
• Models and solution techniques for frequency assignment problems
• Static frequency assignment in cellular networks
• Absolute and asymptotic bounds for online frequency allocation in cellular networks

This page was built for publication: Better bounds for incremental frequency allocation in bipartite graphs