000 | 05018nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-540-45078-8 | ||
003 | DE-He213 | ||
005 | 20240423132600.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540450788 _9978-3-540-45078-8 |
||
024 | 7 |
_a10.1007/b11837 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aUM _2thema |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aAlgorithms and Data Structures _h[electronic resource] : _b8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings / _cedited by Frank Dehne, Jörg Rüdiger Sack, Michiel Smid. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aXII, 522 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2748 |
|
505 | 0 | _aMulti-party Pseudo-Telepathy -- Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips -- Shape Segmentation and Matching with Flow Discretization -- Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content -- Toward Optimal Motif Enumeration -- Common-Deadline Lazy Bureaucrat Scheduling Problems -- Bandwidth-Constrained Allocation in Grid Computing -- Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection -- Fast Algorithms for a Class of Temporal Range Queries -- Distribution-Sensitive Binomial Queues -- Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees -- Extremal Configurations and Levels in Pseudoline Arrangements -- Fast Relative Approximation of Potential Fields -- The One-Round Voronoi Game Replayed -- Integrated Prefetching and Caching with Read and Write Requests -- Online Seat Reservations via Offline Seating Arrangements -- Routing and Call Control Algorithms for Ring Networks -- Algorithms and Models for Railway Optimization -- Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles -- Multi-way Space Partitioning Trees -- Cropping-Resilient Segmented Multiple Watermarking -- On Simultaneous Planar Graph Embeddings -- Smoothed Analysis -- Approximation Algorithm for Hotlink Assignments in Web Directories -- Drawing Graphs with Large Vertices and Thick Edges -- Semi-matchings for Bipartite Graphs and Load Balancing -- The Traveling Salesman Problem for Cubic Graphs -- Sorting Circular Permutations by Reversal -- An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data -- Dynamic Text and Static Pattern Matching -- Real Two Dimensional Scaled Matching -- Proximity Structures for Geometric Graphs -- The Zigzag Path of a Pseudo-Triangulation -- Alternating Paths along Orthogonal Segments -- Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem -- Chips on Wafers -- A Model for Analyzing Black-Box Optimization -- On the Hausdorff Voronoi Diagram of Point Clusters in the Plane -- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries -- Significant-Presence Range Queries in Categorical Data -- Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree -- Parameterized Complexity of Directed Feedback Set Problems in Tournaments -- Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs -- New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aNumerical analysis. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aDehne, Frank. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSack, Jörg Rüdiger. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSmid, Michiel. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540405450 |
776 | 0 | 8 |
_iPrinted edition: _z9783662212875 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2748 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b11837 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189376 _d189376 |