| 000 -LEADER |
|---|
| fixed length control field |
04265nam a22005055i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310144050.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 |
100610s2010 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642137310 |
|
978-3-642-13731-0 |
| 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 |
Kaplan, Haim. |
| Relator term |
editor. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Algorithm Theory - SWAT 2010 |
| Medium |
[electronic resource] : |
| Remainder of title |
12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / |
| Statement of responsibility, etc |
edited by Haim Kaplan. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
448p. 69 illus. |
| 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 |
6139 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Optimal Exploration of Terrains with Obstacles -- Reconstructing a Simple Polygon from Its Angles -- Semidefinite Programming and Approximation Algorithms: A Survey -- Strictly-Regular Number System and Data Structures -- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times -- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition -- A Bottom-Up Method and Fast Algorithms for max independent set -- Capacitated Domination Faster Than O(2 n ) -- Isomorphism for Graphs of Bounded Feedback Vertex Set Number -- On Feedback Vertex Set New Measure and New Structures -- Conflict-Free Coloring Made Stronger -- Polychromatic Coloring for Half-Planes -- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem -- Minimum and Maximum against k Lies -- Feasible and Accurate Algorithms for Covering Semidefinite Programs -- The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms -- Systems of Linear Equations over and Problems Parameterized above Average -- Capacitated max -Batching with Interval Graph Compatibilities -- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs -- Representing a Functional Curve by Curves with Fewer Peaks -- Bregman Clustering for Separable Instances -- Improved Methods For Generating Quasi-gray Codes -- The MST of Symmetric Disk Graphs Is Light -- Vector Bin Packing with Multiple-Choice -- Bin Packing with Fixed Number of Bins Revisited -- Cops and Robber Game without Recharging -- Path Schematization for Route Sketches -- Approximation Algorithms for Free-Label Maximization -- Phase Transitions in Sampling Algorithms and the Underlying Random Structures -- Polynomial Kernels for Hard Problems on Disk Graphs -- Faster Parameterized Algorithms for Minor Containment -- Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing -- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput -- Online Function Tracking with Generalized Penalties -- Better Bounds on Online Unit Clustering -- Online Selection of Intervals and t-Intervals -- Approximating the Maximum 3- and 4-Edge-Colorable Subgraph -- Improved Algorithm for Degree Bounded Survivable Network Design Problem -- Minimizing the Diameter of a Network Using Shortcut Edges. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book constitutes the proceedings of the 12th International Scandinavian Workshop on Algorithm Theory, held in Bergen, Norway in June 2010. |
| 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 |
Computational complexity. |
|
|---|
| Topical term or geographic name as entry element |
Computer graphics. |
|
|---|
| 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 |
Computer Graphics. |
|
|---|
| Topical term or geographic name as entry element |
Data Structures. |
|
|---|
| Topical term or geographic name as entry element |
Computation by Abstract Devices. |
|
|---|
| Topical term or geographic name as entry element |
Mathematical Logic and Formal Languages. |
| 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 |
9783642137303 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-13731-0 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
