Conference paper
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
Preemptive open shop scheduling can be viewed as an edge coloring problem in a bipartite multigraph. In some applications, restrictions of colors (in particular preassignments) are made for some edges. We give characterizations of graphs where some special preassignments can be embedded in a minimum coloring (number of colors = maximum degree). The case of restricted colorings of trees is shown to be solvable in polynomial time.
Jianke Yang, Robin Walters, et al.
ICML 2023
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007