2 papers
cs.LO2026
Proving Optimality for the Bandwidth Multicoloring Problem via SAT
Duc Trung Kim Nguyen, Khanh Van To
The Bandwidth Multicoloring Problem (BMCP) is an NP-hard extension of the Bandwidth Coloring Problem (BCP) with important applications in telecommunications, resource allocation, a…
cs.LO2026
SAT Encodings for Bandwidth Coloring: A Systematic Design Study
Duc Trung Kim Nguyen, Tuyen Van Kieu, Khanh Van To
The Bandwidth Coloring Problem (BCP) generalizes graph coloring by enforcing minimum separation constraints between adjacent vertices and arises in frequency assignment application…