Better bounds for incremental frequency allocation in bipartite graphs

DOI10.1016/J.TCS.2012.05.020MaRDI QIDQ386900zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Better bounds for incremental frequency allocation in bipartite graphs
• Three Results on Frequency Assignment in Linear Cellular Networks
• Three results on frequency assignment in linear cellular networks
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• Frequency Allocation Problems for Linear Cellular Networks

Cites work

• scientific article; zbMATH DE number 6118222 (Why is no real title available?)
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• Channel assignment and weighted coloring
• Frequency Allocation Problems for Linear Cellular Networks
• Greedy online frequency allocation in cellular networks
• Models and solution techniques for frequency assignment problems
• Static frequency assignment in cellular networks
• Three results on frequency assignment in linear cellular networks

Cited in

(5)

• Three results on frequency assignment in linear cellular networks
• Online Multi-Coloring with Advice
• Online multi-coloring with advice
• Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation
• Better bounds for incremental frequency allocation in bipartite graphs

Describes a project that uses

Uses Software

• CALMA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386900)