\texttt{Picasso}: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing.
S. M. FerdousReece NeffBo PengSalman ShuvoMarco MinutoliSayak MukherjeeKarol KowalskiMichela BecchiMahantesh HalappanavarPublished in: CoRR (2024)
Keyphrases
- graph coloring
- memory efficient
- quantum computing
- combinatorial problems
- job shop scheduling
- constraint satisfaction problems
- scheduling problem
- phase transition
- mobile computing
- quantum mechanics
- max sat
- constraint programming
- neural network
- linear programming
- artificial neural networks
- combinatorial optimization
- constraint satisfaction
- metaheuristic
- hyper heuristics
- mobile devices
- artificial intelligence