DIMACS Workshop on Network Design: Connectivity and Facilities Location
April 28-30, 1997
Princeton University (Nassau Inn), Princeton, NJ
- Ding-Zhu Du, University of Minnesota, email@example.com
- Panos Pardalos, University of Florida, firstname.lastname@example.org
- Advisory Committee:
- P. Berman, Penn. State Univ.
- Marshall Bern, Xerox Corporation
- R.E. Burkhard, University of Graz
- A. Goldberg, NEC
- D. Frank Hsu, Fordham University
- Frank K. Hwang, Rutcor
- Takao Nishizeki, Tohoku University
- Marek Karpinski, University of Bonn
- W.R. Pullleybank, IBM T.J. Watson Research Center
- H. Roberstein, University of Molburn
- C.K. Wong, Chinese University of HongKong
Distinguished Speaker: Sanjeev Arora
Connectivity and facilities location are two important
topics in network designs with applications in data communication,
transportation, production planning, and VISI designs.
There are two issues concerning these two topics: design
and optimization. They involve combinatorial design and combinatorial
optimization. Finding the solution of design problems, and the optimal or
approximate solution of the related optimization problem are challenging
tasks because no polynomial time algorithms are known. Such problems
include some variations of Steiner tree problems (such as multiple connected
Steiner network, independent flow problem, and subset-interconnection
designs), topology network design, nonlinear assignment problems
(such as quadratic assignment problems), problems in facilities
location and allocation and network problems appearing in VLSI design.
The workshop will focus on combinatorial, algorithmic, and applicational
aspects of these problems. We will be especially interested in efficient
approximation algorithms and their computational performance.
Additional information on travel and local accommodations will be
provided at a later date. More information on the DIMACS special
year on Networks can be obtained from the DIMACS web pages:
Next: Call for Participation
Contacting the Center
Document last modified on October 22, 1998.