October 1-6, 2006
Bertinoro, Italy
University Residential Center, Bertinoro International Center for Informatics
This workshop is organized under the auspices of the NSF
ITR-funded ALADDIN Center, in which this is the second
meeting of a PROBlem-oriented Exploration (or PROBE) on
the topic. Network Design with its many variants is one of
the most active mathematical research areas involving
researchers from Theoretical Science, Graph Theory,
Operations Research, Discrete Optimization, Game Theory
and Information Theory. In addition, new problems in this
area are constantly propounded by practitioners working
in various aspects of network design such as construction,
routing and staged deployment. Furthermore, many new
design paradigms such as ATM, Ad Hoc and Wireless
networking add rich new flavors to existing problems. The
goal of this PROBE is to focus on this active area of
applications of algorithms to understand current trends,
identify understudied areas, and formulate new directions
for further investigation. To this end, the PROBE will
solicit participation from a sufficiently eclectic mix of
experts from real-world network design and deployment,
graph algorithms, network coding, algorithmic mechanism
design applied to pricing problems in networks, and
configuration and routing of networks.
This workshop is currently in the planning stage; details
will be published on this Web site as they become
available.
Organizers
Matthew Andrews, Bell Labs
Moses Charikar, Princeton University
Anupam Gupta, Carnegie
Mellon University
Stefano Leonardi, Università di Roma "La Sapienza"
R. Ravi, Carnegie
Mellon University