3rd Workshop on Flexible Network Design
The 3rd Research Workshop on Flexible Network Design will be held at DIMAP, University of Warwick, July 13 - 16, 2008 (just after ICALP 2008). Participation is per invitation only.
Final schedule (one page, pdf format)
Description:
Network Design with its many variants is one of the most active mathematical research areas involving researchers from Theoretical Computer 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 the workshop is to focus on this active area of applications of algorithms to discuss recent advances, understand current trends, identify understudied areas, and formulate new directions for further investigation. The participants will be invited to give a presentation on their recent research work.
Organizers:
- Artur Czumaj, DIMAP and University of Warwick
- Anupam Gupta, Carnegie Mellon University
- Stefano Leonardi, Università di Roma "La Sapienza"
- R. Ravi, Carnegie Mellon University
- Harald Räcke, DIMAP and University of Warwick
Previous Meetings in the Series:
-
1st Workshop on Flexible Network Design, November 4 - 5, 2005, Princeton University, Princeton, NJ.
-
2nd Workshop on Flexible Network Design, October 2 - 6, 2006, University of Bologna Residential Center Bertinoro (Forli), Italy.
Participants:
- Andrews, Matthew (Bell Labs)
- Approximately Solving Fixed Packing Problems in Time Linear in the Error
- Bansal, Nikhil (IBM Watson, Yorktown)
- Degree Bounded Network Design
- Chawla, Shuchi (University of Wisconsin at Madison)
- Bertrand Competition in Networks
- Czumaj, Artur (DIMAP, University of Warwick)
- Englert, Matthias (RWTH Aachen)
- The Power of Reordering for Online Minimum Makespan Scheduling
- Erlebach, Thomas (University of Leicester)
- Domination in Geometric Intersection Graphs
- Fiat, Amos (Tel Aviv University)
- Subjective vs. Objective Reality - the Risk of Running Late
- Ganesh, Ayalvadi (University of Bristol)
- Controlling Epidemic Spread on Networks
- Garg, Naveen (IIT New Delhi)
- Facility Location with Uniform Capacities
- Gasieniec, Leszek (University of Liverpool)
- Grandoni, Fabrizio (Universita di Roma Tor Vergata)
- Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle
- Griffin, Tim (University of Cambridge)
- The Metarouting Project
- Gupta, Anupam (Carnegie Mellon University)
- Hajiaghayi, MohammadTaghi (AT&T)
- Game Theory and Wireless Network Design: Cell Breathing in Wireless LANs
- Jain, Kamal (Microsoft Research, Redmond)
- Atomic Economics
- Koster, Arie (DIMAP, University of Warwick)
- Kumar, Amit (IIT New Delhi)
- Approximation Algorithms for Stochastic Steiner Tree
- Lau, Lap Chi (Chinese University of Hong Kong)
- Degree Bounded Network Design with Metric Costs
- Leonardi, Stefano (Universita di Roma Sapienza)
- Naor, Seffi (Technion)
- Partitioning Graphs into Balanced Components
- Olver, Neil (McGill University)
- The VPN Conjecture is True
- Oriolo, Gianpaolo (Universita di Roma Tor Vergata)
- The VPN Problem with Concave Costs
- Paterson, Mike (DIMAP, University of Warwick)
- Rabani, Yuval (Technion)
- Approximation Algorithms for Graph Homomorphism Problems
- Räcke, Harald (DIMAP, University of Warwick)
- Optimal Hierarchical Decompositions for Congestion Minimization in Networks
- Ravi, R (Carnegie Mellon University, Tepper School of Business)
- The Directed Minimum Latency Problem
- Rothvoss, Thomas (EPFL)
- Approximation Connected Facility Location Problems via Random Facility Sampling and Core Detouring
- Sankowski, Piotr (Universita di Roma Sapienza)
- Stochastic Online Steiner Tree
- Scheideler, Christian (Technische Universität München)
- An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model
- Shepherd, Bruce (McGill University)
- A Comparison between Dynamic and Oblivious Routing Models for Robust Network Design
- Singh, Mohit (Microsoft Research, New England)
- Iterative Methods in Combinatorial Optimization
- Swamy, Chaitanya (University of Waterloo)
- Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions
- Talwar, Kunal (Microsoft Research, Sillicon Valley)
- A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search
- Voecking, Berthold (RWTH Aachen)
- Walker, Nigel (BT Labs)
- Dynamic Bandwidth Assignment in Core Networks
- Wilfong, Gordon (Bell Labs)
- A Fractional Model of the Border Gateway Protocol (BGP)
- Wischik, Damon (University College London)
- Short Messages: Algorithm Design and Analysis for Unreliable Networks