Soft Edge Coloring

DOI10.1007/978-3-540-74208-1_14zbMATH Open1171.90534OpenAlexW1962168719MaRDI QIDQ3603465FDOQ3603465

Authors: Chadi Kari, Yoo-Ah Kim, Alexander Russell, Minho Shin, Seungjoon Lee 

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_14

Recommendations

• Soft graph coloring
• Flexible coloring
• Edge homogeneous colorings
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Edge Colouring with Delays
• scientific article; zbMATH DE number 4202279
• Rainbow edge-coloring and rainbow domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Communication networks in operations research (90B18)

Cited In (6)

• A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
• Maximum scan statistics and channel assignment problems in homogeneous wireless networks
• Spectrum graph coloring and applications to Wi-Fi channel assignment
• Heuristic algorithms for the min-max edge 2-coloring problem
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
• Channel Dependent Interference and Decentralized Colouring

This page was built for publication: Soft Edge Coloring

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