Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers /

This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event. The 23 revised full papers presented were carefully reviewe...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Jansen, Klaus (Επιμελητής έκδοσης), Solis-Oba, Roberto (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011.
Σειρά:Lecture Notes in Computer Science, 6534
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02786nam a22005415i 4500
001 978-3-642-18318-8
003 DE-He213
005 20151204170852.0
007 cr nn 008mamaa
008 110124s2011 gw | s |||| 0|eng d
020 |a 9783642183188  |9 978-3-642-18318-8 
024 7 |a 10.1007/978-3-642-18318-8  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Approximation and Online Algorithms  |h [electronic resource] :  |b 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers /  |c edited by Klaus Jansen, Roberto Solis-Oba. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2011. 
300 |a X, 273 p. 18 illus., 3 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6534 
520 |a This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event. The 23 revised full papers presented were carefully reviewed and selected from 58 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques, real-world applications, and scheduling problems. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Computer graphics. 
650 1 4 |a Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Numeric Computing. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Information Systems Applications (incl. Internet). 
650 2 4 |a Algorithms. 
700 1 |a Jansen, Klaus.  |e editor. 
700 1 |a Solis-Oba, Roberto.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642183171 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6534 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-18318-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)