The paper is on a greedy reduction algorithm that finds the minimum number of connections required for a set of routing requirements. I have probably mentioned something about it in earlier posts. The algorithm has quite a few applications. My advisor, Dr. Fan plans to use it for designing circuits, networks-on-chip and FPGAs and I have used it in a simulation for wireless networks. I will post the paper sometime after I get the go-ahead from my advisor, which I imagine will be sometime after it has been officially published.

I realize this post is somewhat sort and theres not much to it but theres not much time for posting these days since the advisors are pushing me to decide on a new direction for my thesis within the next couple of days. So back to work for me, yay reading!