THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS

DOI10.1142/S1793830912500280zbMath1253.68074MaRDI QIDQ3166742

Cláudia Linhares Sales, Florian Huc, Herve Rivano

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

edge coloringcall schedulingmesh networksproportional coloring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• On the complexity of bandwidth allocation in radio networks
• On the complexity of decomposing matrices arising in satellite communication
• Edge coloring nearly bipartite graphs
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• Resource-sharing system scheduling and circular chromatic number
• Wireless mesh networks: a survey
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• Scheduling to Minimize Interaction Cost
• Sharing resources at nonuniform access rates

This page was built for publication: THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS