000 -LEADER |
fixed length control field |
04089nam a22005415i 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20140310144048.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
100509s2010 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783642124501 |
|
978-3-642-12450-1 |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA76.9.A43 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
005.1 |
Edition number |
23 |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg, |
-- |
2010. |
912 ## - |
-- |
ZDB-2-SCS |
|
-- |
ZDB-2-LNC |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Bampis, Evripidis. |
Relator term |
editor. |
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
Title |
Approximation and Online Algorithms |
Medium |
[electronic resource] : |
Remainder of title |
7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers / |
Statement of responsibility, etc |
edited by Evripidis Bampis, Klaus Jansen. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
X, 255p. |
Other physical details |
online resource. |
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
Title |
Lecture Notes in Computer Science, |
International Standard Serial Number |
0302-9743 ; |
Volume number/sequential designation |
5893 |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
WAOA 2009 -- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems -- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications -- Price Fluctuations: To Buy or to Rent -- Approximation Algorithms for Multiple Strip Packing -- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window -- Longest Wait First for Broadcast Scheduling [Extended Abstract] -- The Routing Open Shop Problem: New Approximation Algorithms -- On the Price of Stability for Undirected Network Design -- Finding Dense Subgraphs in G(n,1/2) -- Parameterized Analysis of Paging and List Update Algorithms -- Online Scheduling of Bounded Length Jobs to Maximize Throughput -- On the Additive Constant of the k-Server Work Function Algorithm -- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs -- Guard Games on Graphs: Keep the Intruder Out! -- Between a Rock and a Hard Place: The Two-to-One Assignment Problem -- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width -- Online Minimization Knapsack Problem -- Optimization Problems in Multiple Subtree Graphs -- Multi-Criteria TSP: Min and Max Combined -- Packet Routing: Complexity and Algorithms -- Minimal Cost Reconfiguration of Data Placement in Storage Area Network -- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing. |
520 ## - SUMMARY, ETC. |
Summary, etc |
This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer science. |
|
Topical term or geographic name as entry element |
Data structures (Computer science). |
|
Topical term or geographic name as entry element |
Computer software. |
|
Topical term or geographic name as entry element |
Electronic data processing. |
|
Topical term or geographic name as entry element |
Computational complexity. |
|
Topical term or geographic name as entry element |
Computer graphics. |
|
Topical term or geographic name as entry element |
Algorithms. |
|
Topical term or geographic name as entry element |
Computer Science. |
|
Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
|
Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
Topical term or geographic name as entry element |
Numeric Computing. |
|
Topical term or geographic name as entry element |
Computer Graphics. |
|
Topical term or geographic name as entry element |
Data Structures. |
|
Topical term or geographic name as entry element |
Algorithms. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Jansen, Klaus. |
Relator term |
editor. |
710 2# - ADDED ENTRY--CORPORATE NAME |
Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY |
Title |
Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Printed edition: |
International Standard Book Number |
9783642124495 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-12450-1 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
E-Book |