...researching fundamentals of networking and communications


Using Approximation Algorithm of Minimum Steiner Tree to Implement Connected Identifying Code - 02/04/2011

Wei Si

In this talk, we will first review over the concept of ID-code and connected ID-code, which Niloofar has been working on. Then we will introduce the problem of Minimum Steiner Tree and illustrate an approximation algorithm to solve the problem.

Finally, we will see how the approximation algorithm will be used in the connected ID-code problem. However, we still need to wait until the experiment is finished to see whether there is improvement on the size of connected ID-code.

-- JiaxiJin - 09 Feb 2011

r1 - 2011-02-09 - 17:12:57 - JiaxiJin

Laboratory of Networking and Information Systems
Photonics Building, Room 413
8 St Mary's Street,
Boston MA 02215

Initial web site created by Sachin Agarwal (ska@alum.bu.edu), Modified by Weiyao Xiao (weiyao@alum.bu.edu), Moved to TWiki backend by Ari Trachtenberg (trachten@bu.edu). Managed by Jiaxi Jin (jin@bu.edu).
Syndicate this site RSSATOM