Tag Archives: spanning trees
MCMC in Python: Custom StepMethods and bounded-depth spanning tree distraction
I was looking for a distraction earlier this week, which led me to the world of stackexchange sites. The stack overflow has been on my radar for a while now, because web-search for coding questions often leads there and the … Continue reading
ACO in Python: PADS for Minimum Spanning Trees
Sometimes, instead of working, I like to see what search terms are bringing readers to my blog. The most common search that healthyalgorithms has been most useless for is “minimum spanning tree python”. Today, I’ll remedy that. But first, dear … Continue reading
Filed under combinatorial optimization
Minimum Spanning Trees of Bounded Depth (Random)
I’ve got a new paper up on the arxiv. David Wilson recently posted this joint work that was one of the last things I did during my post-doc at Microsoft. It hasn’t been applied to health metrics yet, but maybe … Continue reading
Filed under combinatorial optimization, probability
