Login / Signup
Building Optimal Steiner Trees on Supercomputers by Using up to 43, 000 Cores.
Yuji Shinano
Daniel Rehfeldt
Thorsten Koch
Published in:
CPAIOR (2019)
Keyphrases
</>
steiner tree
minimum spanning tree
dynamic programming
shortest path
social networks
reinforcement learning
worst case
massively parallel
parallel architectures