0
Your cart

Your cart is empty

Books > Computing & IT

Not currently available

Algorithm Theory – SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings (Paperback, 2008 ed.) Loot Price: R1,943
Discovery Miles 19 430
Algorithm Theory – SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008,...

Algorithm Theory – SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings (Paperback, 2008 ed.)

Joachim Gudmundsson

Series: Lecture Notes in Computer Science, 5124

 (sign in to rate)
Loot Price R1,943 Discovery Miles 19 430 | Repayment Terms: R182 pm x 12*

Bookmark and Share

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

The Scandinavian Workshop on Algorithm Theory (SWAT) is a biennial int- national conferenceintended as a forum for researchersin the area of design and analysisofalgorithmsanddatastructures. The?rstSWATworkshopwasheldin Halmstad, Sweden, in 1988. Since then it has been held biennially, rotating - tween the ?ve Nordic countries - Denmark, Finland, Iceland, Norway and S- den, with the exception of 2006 when it was in Riga. Earlier SWATs were held in Humlebaek, Denmark (2004), Turku, Finland (2002), Bergen, Norway (2000), ? Stockholm, Sweden (1998), Reykjavik, Iceland (1996), Arhus, Denmark (1994), Helsinki,Finland(1992),Bergen,Norway(1990)andHalmstad,Sweden(1988). This volume contains the contributed papers presented at the 11th Sc- dinavian Workshop on Algorithm Theory (SWAT 2008), held in Gothenburg, Sweden, July 2-4, 2008. In addition, the volume also includes abstracts of an invited talk by Michael Mitzenmacher on "A Survey of Results for Deletion Channels and Related Synchronization Channels"and by Vijay V. Vazirani on "Nash Bargaining via Flexible Budget Markets. " Papers were solicited for original research on algorithms and data structures in all areas, including but not limited to: approximation algorithms, compu- tionalbiology,computationalgeometry,distributedalgorithms,external-memory algorithms,graphalgorithms,online algorithms,optimization algorithms,par- lel algorithms, randomized algorithms, string algorithms and algorithmic game theory. The 36 contributed papers were chosen from 111 submissions. Revised and expanded versions of selected papers will be considered for publication in a special issue of Algorithmica. The best paper award was given to Yossi Azar, Uriel Feige and Daniel Glasner for their paper "A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. " Eachpaperwasreviewedbyatleastthreereferees,andevaluatedonthequ- ity,originalityandrelevanceto the symposium.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 5124
Release date: June 2008
First published: 2008
Editors: Joachim Gudmundsson
Dimensions: 235 x 155 x 28mm (L x W x T)
Format: Paperback
Pages: 438
Edition: 2008 ed.
ISBN-13: 978-3-540-69900-2
Categories: Books > Computing & IT > General
Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Infinite series
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling
LSN: 3-540-69900-7
Barcode: 9783540699002

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners