Approximation and Online Algorithms (Record no. 53165)

000 -LEADER
fixed length control field 03295nam a22005295i 4500
001 - CONTROL NUMBER
control field 978-3-319-08001-7
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200420221300.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 140610s2014 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783319080017
-- 978-3-319-08001-7
082 04 - CLASSIFICATION NUMBER
Call Number 005.1
245 10 - TITLE STATEMENT
Title Approximation and Online Algorithms
Sub Title 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 169 p. 20 illus.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Mathematics.
700 1# - AUTHOR 2
Author 2 Kaklamanis, Christos.
700 1# - AUTHOR 2
Author 2 Pruhs, Kirk.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-319-08001-7
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2014.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithms.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Numerical analysis.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Numeric Computing.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithms.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC

No items available.