Fundamentals of Computation Theory

13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings

564 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the ?rst FCT 1977, the conference brings together specialists in theoretical ?elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE?cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ?ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide?nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: ¿ Poznan-K¿ ornik, Poland, 1977 ¿ Wendish-Rietz, Germany, 1979 ¿ Szeged, Hungary, 1981 ¿ Borgholm, Sweden, 1983 ¿ Cottbus, Germany, 1985 ¿ Kazan, Russia, 1987 ¿ Szeged, Hungary, 1989 ¿ Gosen-Berlin, Germany, 1991 ¿ Szeged, Hungary, 1993 ¿ Dresden, Germany, 1995 ¿ Krak¿ ow, Poland, 1997 ¿ Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Theoretische Informatik
• ISBN: 9783540424871
• Sprache: Englisch
• Erscheinungsdatum: 03.08.2001
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Rusins Freivalds