Fundamentals of Computation Theory : 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings

Rusins Freivalds

ISBN 10: 3540424873 / ISBN 13: 9783540424871

Published by Springer Berlin Heidelberg, 2001

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783540424871

Bibliographic Details

• Title: Fundamentals of Computation Theory : 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings
• Publisher: Springer Berlin Heidelberg
• Publication Date: 2001
• Language: English
• ISBN 10: 3540424873
• ISBN 13: 9783540424871
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 31D millimeters 235 millimeters width by 155 millimeters height by 31 millimeters depth
• Weight: 844 grams

About this title

Synopsis

This book constitutes the refereed proceedings of the 13th International Symposium Fundamentals of Computation Theory, FCT 2001, as well as of the International Workshop on Efficient Algorithms, WEA 2001, held in Riga, Latvia, in August 2001. The 28 revised full FCT papers and 15 short papers presented together with six invited contributions and 8 revised full WEA papers as well as three invited WEA contributions have been carefully reviewed and selected. Among the topics addressed are a broad variety of topics from theoretical computer science, algorithmics and programming theory. The WEA papers deal with graph and network algorithms, flow and routing problems, scheduling and approximation algorithms, etc.