Algorithm Theory - SWAT 2004 (Record no. 32558)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 04656nam a22005775i 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783540278108 |
-- | 978-3-540-27810-8 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 005.1 |
245 10 - TITLE STATEMENT | |
Title | Algorithm Theory - SWAT 2004 |
Sub Title | 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings / |
Statement of responsibility, etc | edited by Torben Hagerup, Jyrki Katajainen. |
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication | Berlin, Heidelberg : |
Name of publisher | Springer Berlin Heidelberg, |
Year of publication | 2004. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XII, 512 p. |
Other physical details | online resource. |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Computer Science, |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( )–Approximation Algorithm for the Stable Marriage Problem -- Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Communication Networks. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Data structures (Computer science). |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer software. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computational complexity. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer graphics. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Algorithms. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Algorithm Analysis and Problem Complexity. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Communication Networks. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Data Structures. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Discrete Mathematics in Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Graphics. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Algorithms. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Hagerup, Torben. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Katajainen, Jyrki. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/b98413 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | E-BOOKS |
264 #1 - | |
-- | Berlin, Heidelberg : |
-- | Springer Berlin Heidelberg, |
-- | 2004. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
-- | 0302-9743 ; |
Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
---|---|---|---|---|---|---|---|
IMSc Library | EBK3264 | http://dx.doi.org/10.1007/b98413 | E-BOOKS |