|
|
|
|
| LEADER |
03365nam a22005775i 4500 |
| 001 |
978-3-319-28684-6 |
| 003 |
DE-He213 |
| 005 |
20160113142920.0 |
| 007 |
cr nn 008mamaa |
| 008 |
160112s2015 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319286846
|9 978-3-319-28684-6
|
| 024 |
7 |
|
|a 10.1007/978-3-319-28684-6
|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 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /
|c edited by Laura Sanità, Martin Skutella.
|
| 250 |
|
|
|a 1st ed. 2015.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2015.
|
| 300 |
|
|
|a X, 209 p. 24 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 9499
|
| 505 |
0 |
|
|a Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.
|
| 520 |
|
|
|a This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 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 Data Structures.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 700 |
1 |
|
|a Sanità, Laura.
|e editor.
|
| 700 |
1 |
|
|a Skutella, Martin.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319286839
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 9499
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-28684-6
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
