/SND Group/Seminar2009

Seminar Series

1. Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem [PDF]

2. Geometric Rounding: A Dependent Rounding Scheme for AllocationProblems [PDF]

3. STAR: Steiner-Tree Approximation in Relationship Graphs [PDF]

4. STAR: Steiner-Tree Approximation in Relationship Graphs [PDF]

5. Randomized Rounding with Cardinality constraints and Derandomization [PDF]

6. A Survey on Real-World Implementations of Mobile Ad-Hoc Networks [PDF]

7. Routing in a Cyclic MobiSpace [PDF]

8. Maintaining Sensing Coverage and Connectivity in Large Sensor Network [PDF]

9. Mathematics Problem && Deployment of Base Station on High way for communication between vehicles and BSs [PDF]

10. MAX SNP-Hardness and an Approximation of the Internal Steiner Tree Problem [PDF]

11. A framework for community identification in dynamic social networks [PDF]

12. Dynamic social networks Research Topic Discussion