Himanshu Dutta

Learn More
Problem In t his t hesis, I s urvey 11 a pproximation algorithms for u nweighted s et cover problem. I have also implemented the three algorithms and created a software library that stores the code I have written. The a lgorithms I s urvey a re: 1. J ohnson's s tandard gr eedy 2. f-frequency greedy 3. Goldsmidt, Hochbaum and Yu's modified greedy 4.(More)
In this paper, we propose an application layer based modified weight-throwing protocol for the distributed termination detection problem in a purely mobile distributed environment with no static hosts. The mobile hosts are considered with limited functionality. We discuss the effect of mobility on the proposed algorithm and analyze it.
  • 1