000 | 04285nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-69903-3 | ||
003 | DE-He213 | ||
005 | 20240423125607.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540699033 _9978-3-540-69903-3 |
||
024 | 7 |
_a10.1007/978-3-540-69903-3 _2doi |
|
050 | 4 | _aQ336 | |
072 | 7 |
_aUN _2bicssc |
|
072 | 7 |
_aCOM021000 _2bisacsh |
|
072 | 7 |
_aUN _2thema |
|
082 | 0 | 4 |
_a005.7 _223 |
245 | 1 | 0 |
_aAlgorithm Theory – SWAT 2008 _h[electronic resource] : _b11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / _cedited by Joachim Gudmundsson. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXIII, 438 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5124 |
|
505 | 0 | _aInvited 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 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer networks . | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aData Science. |
650 | 2 | 4 | _aDiscrete Mathematics. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aGudmundsson, Joachim. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540699002 |
776 | 0 | 8 |
_iPrinted edition: _z9783540866121 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5124 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-69903-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c179655 _d179655 |