Algorithm Theory - SWAT 2006 (Record no. 85874)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 04725nam a22006015i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-540-35755-1 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240730164738.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 | 100301s2006 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9783540357551 |
-- | 978-3-540-35755-1 |
024 7# - OTHER STANDARD IDENTIFIER | |
Standard number or code | 10.1007/11785293 |
Source of number or code | doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA76.9.A43 |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UMB |
Source | bicssc |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | COM051300 |
Source | bisacsh |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UMB |
Source | thema |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 518.1 |
Edition number | 23 |
245 10 - TITLE STATEMENT | |
Title | Algorithm Theory - SWAT 2006 |
Medium | [electronic resource] : |
Remainder of title | 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / |
Statement of responsibility, etc. | edited by Lars Arge, Rusins Freivalds. |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2006. |
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
Place of production, publication, distribution, manufacture | Berlin, Heidelberg : |
Name of producer, publisher, distributor, manufacturer | Springer Berlin Heidelberg : |
-- | Imprint: Springer, |
Date of production, publication, distribution, manufacture, or copyright notice | 2006. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | XII, 436 p. |
Other physical details | online resource. |
336 ## - CONTENT TYPE | |
Content type term | text |
Content type code | txt |
Source | rdacontent |
337 ## - MEDIA TYPE | |
Media type term | computer |
Media type code | c |
Source | rdamedia |
338 ## - CARRIER TYPE | |
Carrier type term | online resource |
Carrier type code | cr |
Source | rdacarrier |
347 ## - DIGITAL FILE CHARACTERISTICS | |
File type | text file |
Encoding format | |
Source | rda |
490 1# - SERIES STATEMENT | |
Series statement | Theoretical Computer Science and General Issues, |
International Standard Serial Number | 2512-2029 ; |
Volume/sequential designation | 4059 |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | Invited Papers -- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily) -- Results and Problems on Self-adjusting Search Trees and Related Data Structures -- Classic and Quantum Network Coding -- Contributed Papers -- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers -- Scheduling Jobs on Grid Processors -- Variable Sized Online Interval Coloring with Bandwidth -- A Simpler Linear-Time Recognition of Circular-Arc Graphs -- An Algorithm for Online Topological Ordering -- Dynamic Matching Markets and Voting Paths -- Sorting by Merging or Merging by Sorting? -- Finding the Position of the k-Mismatch and Approximate Tandem Repeats -- Unbiased Matrix Rounding -- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines -- Paging with Request Sets -- Decentralization and Mechanism Design for Online Machine Scheduling -- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes -- Exact Computation of Maximum Induced Forest -- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus -- On the Approximation Hardness of Some Generalizations of TSP -- Reoptimization of Minimum and Maximum Traveling Salesman's Tours -- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights -- On Guarding Rectilinear Domains -- Approximation Algorithms for the Minimum Convex Partition Problem -- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles -- Simultaneous Embedding with Two Bends per Edge in Polynomial Area -- Acyclic Orientation of Drawings -- Improved Algorithms for Quantum Identification of Boolean Oracles -- Approximability of Minimum AND-Circuits -- Triangles, 4-Cycles and Parameterized (In-)Tractability -- Better ApproximationSchemes for Disk Graphs -- An Approximation Algorithm for the Wireless Gathering Problem -- Minimum Membership Set Covering and the Consecutive Ones Property -- Approximating Rational Objectives Is as Easy as Approximating Linear Ones -- In-Place Algorithms for Computing (Layers of) Maxima -- Largest and Smallest Tours and Convex Hulls for Imprecise Points -- On Spanners of Geometric Graphs -- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems -- Linear-Time Algorithms for Tree Root Problems -- Generalized Powers of Graphs and Their Algorithmic Use. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Algorithms. |
9 (RLIN) | 3390 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer networks . |
9 (RLIN) | 31572 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Artificial intelligence |
General subdivision | Data processing. |
9 (RLIN) | 21787 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer science |
General subdivision | Mathematics. |
9 (RLIN) | 3866 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Discrete mathematics. |
9 (RLIN) | 12873 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer graphics. |
9 (RLIN) | 4088 |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Algorithms. |
9 (RLIN) | 3390 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer Communication Networks. |
9 (RLIN) | 85896 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Data Science. |
9 (RLIN) | 34092 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Discrete Mathematics in Computer Science. |
9 (RLIN) | 31837 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer Graphics. |
9 (RLIN) | 4088 |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Arge, Lars. |
Relator term | editor. |
Relationship | edt |
-- | http://id.loc.gov/vocabulary/relators/edt |
9 (RLIN) | 85898 |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Freivalds, Rusins. |
Relator term | editor. |
Relationship | edt |
-- | http://id.loc.gov/vocabulary/relators/edt |
9 (RLIN) | 85899 |
710 2# - ADDED ENTRY--CORPORATE NAME | |
Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
9 (RLIN) | 85901 |
773 0# - HOST ITEM ENTRY | |
Title | Springer Nature eBook |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Printed edition: |
International Standard Book Number | 9783540357537 |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Printed edition: |
International Standard Book Number | 9783540826132 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
Uniform title | Theoretical Computer Science and General Issues, |
International Standard Serial Number | 2512-2029 ; |
Volume/sequential designation | 4059 |
9 (RLIN) | 85903 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="https://doi.org/10.1007/11785293">https://doi.org/10.1007/11785293</a> |
912 ## - | |
-- | ZDB-2-SCS |
912 ## - | |
-- | ZDB-2-SXCS |
912 ## - | |
-- | ZDB-2-LNC |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks-Lecture Notes in CS |
No items available.