Efficient Network Reconfiguration by Randomized Switching

Samuel Talkington, Dmitrii M. Ostrovskii, Daniel K. Molzahn

We present an algorithm that efficiently computes nearly-optimal solutions to a class of combinatorial reconfiguration problems on weighted, undirected graphs. Inspired by societal…