03638nam 22006375 450 991048314950332120251226193447.03-319-08001-610.1007/978-3-319-08001-7(CKB)3710000000143871(SSID)ssj0001274644(PQKBManifestationID)11864757(PQKBTitleCode)TC0001274644(PQKBWorkID)11334070(PQKB)11124825(DE-He213)978-3-319-08001-7(MiAaPQ)EBC3093463(PPN)179766392(EXLCZ)99371000000014387120140610d2014 u| 0engurnn#008mamaatxtccrApproximation and Online Algorithms 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /edited by Christos Kaklamanis, Kirk Pruhs1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (X, 169 p. 20 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8447Bibliographic Level Mode of Issuance: Monograph3-319-08000-8 Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability results -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Real-world applications -- Scheduling problems.This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems.Theoretical Computer Science and General Issues,2512-2029 ;8447AlgorithmsComputer scienceMathematicsDiscrete mathematicsNumerical analysisAlgorithmsDiscrete Mathematics in Computer ScienceNumerical AnalysisAlgorithms.Computer scienceMathematics.Discrete mathematics.Numerical analysis.Algorithms.Discrete Mathematics in Computer Science.Numerical Analysis.005.1Kaklamanis Christosedthttp://id.loc.gov/vocabulary/relators/edtPruhs Kirkedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910483149503321Approximation and Online Algorithms2954916UNINA