*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Robertson and Seymour introduced branch-width as a new measure of the connectivity of graphs. Decompositions based on this measure provide a natural framework for implementing dynamic programming algorithms to solve graph optimization problems. In this talk we will discuss the computational
issues involved in using branch-width as as a general tool in discreteoptimization. We will present applications to traveling salesman problems, euclidean steiner tree problems, graph bipartition, maximum cut problems, maximum stable set problems, and network design problems.
