...researching fundamentals of networking and communications


Identifying Code and Set Cover Problem - 06/05/2009

Hasti Ahlehagh

This presentation summarizes the paper on the reduction between the identifying code and the set cover problem. The main goal is to provide good polynomial time approximations to the identifying code problem and address the theoretical limit of this approximation. The analysis includes an extension to the robust identifying code problem that can be shown to be equivalent to the set multicover problem.

r1 - 2009-06-11 - 14:18:40 - AriTrachtenberg

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