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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 11,22 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerAnbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Paperback. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.72. Bestandsnummer des Verkäufers G3540424873I4N00
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Towards Axiomatic Basis of Inductive Inference.- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.- Challenges of Commutation.- Approximating Bounded Degree Instances of NP-Hard Problems.- Universal Al. Bestandsnummer des Verkäufers 4889872
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 564 pp. Englisch. Bestandsnummer des Verkäufers 9783540424871
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. 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. Bestandsnummer des Verkäufers 9783540424871
Anzahl: 1 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 564 pp. Englisch. Bestandsnummer des Verkäufers 9783540424871
Anzahl: 2 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540424871_new
Anzahl: Mehr als 20 verfügbar
Anbieter: D2D Books, Berkshire, Vereinigtes Königreich
Soft cover. Zustand: New. Springer-Verlag Berlin and Heidelberg GmbH & Co. K August 2001, 555 pages A BRAND NEW BOOK STILL IN UNOPENED CELLO WRAPPING. . Full refund if not satisfied. 24 hour despatch. Bestandsnummer des Verkäufers r426
Anzahl: 1 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 566. Bestandsnummer des Verkäufers 1814416629
Anzahl: 4 verfügbar
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Paperback. Zustand: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Bestandsnummer des Verkäufers DA1412073
Anzahl: 1 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 566. Bestandsnummer des Verkäufers 2614416639
Anzahl: 4 verfügbar