Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing.
S. M. FerdousReece NeffBo PengSalman ShuvoMarco MinutoliSayak MukherjeeKarol KowalskiMichela BecchiMahantesh HalappanavarPublished in: IPDPS (2024)
Keyphrases
- graph coloring
- memory efficient
- quantum computing
- job shop scheduling
- combinatorial problems
- constraint satisfaction problems
- phase transition
- mobile computing
- quantum mechanics
- hyper heuristics
- scheduling problem
- max sat
- constraint programming
- traveling salesman problem
- neural network
- job shop scheduling problem
- wireless networks
- genetic programming