Spanning tree constrained determinantal point processes are hard to (approximately) evaluate.

Tatsuya Matsuoka Naoto Ohsaka

Published in: Oper. Res. Lett. (2021)

Keyphrases

point processes
spanning tree
monte carlo
minimum cost
minimum spanning tree
hot spots
minimum spanning trees
minimum weight
spatial analysis
special case
undirected graph
weighted graph
minimum total cost
dynamic programming
edge weights