|
|
|
|
| LEADER |
04026nam a2200589 4500 |
| 001 |
978-3-319-89441-6 |
| 003 |
DE-He213 |
| 005 |
20191028142533.0 |
| 007 |
cr nn 008mamaa |
| 008 |
180330s2018 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319894416
|9 978-3-319-89441-6
|
| 024 |
7 |
|
|a 10.1007/978-3-319-89441-6
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Approximation and Online Algorithms
|h [electronic resource] :
|b 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers /
|c edited by Roberto Solis-Oba, Rudolf Fleischer.
|
| 250 |
|
|
|a 1st ed. 2018.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2018.
|
| 300 |
|
|
|a X, 329 p. 42 illus.
|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 Theoretical Computer Science and General Issues ;
|v 10787
|
| 505 |
0 |
|
|a Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.
|
| 520 |
|
|
|a This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
1 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
| 650 |
2 |
4 |
|a Numeric Computing.
|0 http://scigraph.springernature.com/things/product-market-codes/I1701X
|
| 650 |
2 |
4 |
|a Data Structures.
|0 http://scigraph.springernature.com/things/product-market-codes/I15017
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|0 http://scigraph.springernature.com/things/product-market-codes/I13022
|
| 650 |
2 |
4 |
|a Computer Graphics.
|0 http://scigraph.springernature.com/things/product-market-codes/I22013
|
| 700 |
1 |
|
|a Solis-Oba, Roberto.
|e editor.
|0 (orcid)0000-0002-7518-4161
|1 https://orcid.org/0000-0002-7518-4161
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Fleischer, Rudolf.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319894409
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319894423
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues ;
|v 10787
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-89441-6
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
