Everyone is welcome to attend. In the 12th ACM-SIAM Symposium on Discrete Algorithms, Washington DC, 2001.
Games are a useful tool for classifying structures, such as bit strings and graphs.
We will discuss these results of Fagin, Spencer, and Shelah, and recent work on other important structures in computer science such as bit strings and trees. . We point out that, under general conditions, there is a polynomially succinct curve that approximates the Pareto curve within any desired accuracy, and give conditions under which this approximate Pareto curve can be constructed in polynomial time. We discuss in more detail the class of linear multiobjective problems and multiobjective query optimization. . Evolution operates on whole genomes by operations that change the order and strandedness of genes within the genomes. This type of data presents new opportunities for discoveries about deep evolutionary rearrangement events, provided that sufficiently accurate methods can be developed to reconstruct evolutionary trees in these models.