DIMACS/DyDAn Workshop on Approximation Algorithms in Wireless Ad Hoc and Sensor Networks

April 22 - 24, 2009
DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ

Organizers:

Ding-Zhu Du, University of Texas at Dallas, dzdu at utdallas.edu

Panos M. Pardalos, University of Florida, pardalos at ufl.edu

There are many combinatorial optimization problems appearing in the study of wireless ad hoc and sensor networks, such as minimum connected dominating set, maximum life-time sensor coverage, minimum total energy topology control, etc. Analysis and design of approximation algorithms for those problems form an important part of interdisplinary area of theoretical computer science and computer networks. Due to strong application background, evaluation for a "good" approximation algorithm has to receive some new standards, e.g., easy to do implementation, especially, easy to do distributed implementation and lower message complexity. This workshop would bring researchers from both theoretical computer science and computer netwrking to get together, which would certainly be very helpful for healty growing of this area.

Potential speakers:

• Leonidas Guibas (Stanford University)
• Samir Khuller (University of Maryland)
• Sudipto Guha (University of Pennsylvania)
• Mihaela Cardei (Florida Atlantic University)
• My Thai (University of Florida)
• Joe Mitchell (SUNY, Stony Brook)
• Pengjun Wan (Illinois Institute of Technology)
• Sergay Butenko (Texas A&M University)
• Xiuzhen Cheng (George Washingto University)
• Dung T. Huynh (University of Texas at Dallas)
• Chen Wang (Tsinghua University)
• Ker-I Ko (SUNY, Stony Brook)
• Xiaohua Jia (City University of Hong Kong)
• Alex Zelikovsky (George State University)
• Yingshu Li (George State University)
• Meggie Cheng (University of Missouri-Rolla)
• Guohong Cao (Penn. State University)

Next: Call for Participation

Workshop Index

DIMACS Homepage