|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-69903-3 |
| 003 |
DE-He213 |
| 005 |
20230406012915.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2008 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540699033
|9 978-3-540-69903-3
|
| 024 |
7 |
|
|a 10.1007/978-3-540-69903-3
|2 doi
|
| 050 |
|
4 |
|a Q336
|
| 072 |
|
7 |
|a UN
|2 bicssc
|
| 072 |
|
7 |
|a COM062000
|2 bisacsh
|
| 072 |
|
7 |
|a UN
|2 thema
|
| 082 |
0 |
4 |
|a 005.7
|2 23
|
| 245 |
1 |
0 |
|a Algorithm Theory - SWAT 2008
|h [electronic resource] :
|b 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings /
|c edited by Joachim Gudmundsson.
|
| 250 |
|
|
|a 1st ed. 2008.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2008.
|
| 300 |
|
|
|a XIII, 438 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5124
|
| 505 |
0 |
|
|a Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation.
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
1 |
4 |
|a Data Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computer Graphics.
|
| 700 |
1 |
|
|a Gudmundsson, Joachim.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540866121
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540699002
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5124
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-69903-3
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
