∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Solving Steiner Tree Problem as a MILP

April 10, 2012 blog math

Consider a network , with is a set of focus vertices. Let’s call the multicast sender and the rest the multicast receivers. Given the edges of unit weight, how to find the multicast tree that connects to with minimum total edge weight? This is a generalized minimal spanning tree problem,... [more]

MathProg language by example

April 9, 2012 blog code math

Resources: WikiBooks on GLPK IBM DeveloperWorks article on GLPK, and its part 2 and part 3 [more]

Xi & Chao (2007) ESCAP: Efficient SCan for Alternate Paths to Achieve IP Fast Rerouting (Globecom)

April 3, 2012 paper

The correct way of doing probability

March 30, 2012 blog math

Reading an article from DataGenetics, which shows how people flawed when dealing with probability. [more]

Kini et al (2009) Fast Recovery from Dual Link Failures in IP Networks (INFOCOM)

March 27, 2012 paper

In a 3-edge connected network, the paper propose to build around any node some backup topology for fast recovery. Consider node in the network , and there are several links connected to the other part of the topology, if we build subgraphs , , etc which each of them has... [more]