| 000 | 04919nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-31711-1 | ||
| 003 | DE-He213 | ||
| 005 | 20240730193143.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100312s2005 gw | s |||| 0|eng d | ||
| 020 |
_a9783540317111 _9978-3-540-31711-1 |
||
| 024 | 7 |
_a10.1007/11534273 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a518.1 _223 |
| 245 | 1 | 0 |
_aAlgorithms and Data Structures _h[electronic resource] : _b9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings / _cedited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack. |
| 250 | _a1st ed. 2005. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
| 300 |
_aXIV, 446 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 ; _v3608 |
|
| 505 | 0 | _aSession 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-SavingScheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching. | |
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aDiscrete mathematics. _912873 |
|
| 650 | 0 |
_aComputer graphics. _94088 |
|
| 650 | 0 |
_aNumerical analysis. _94603 |
|
| 650 | 1 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aData Science. _934092 |
| 650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
| 650 | 2 | 4 |
_aComputer Graphics. _94088 |
| 650 | 2 | 4 |
_aNumerical Analysis. _94603 |
| 700 | 1 |
_aDehne, Frank. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9152671 |
|
| 700 | 1 |
_aLópez-Ortiz, Alejandro. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9152672 |
|
| 700 | 1 |
_aSack, Jörg-Rüdiger. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9152673 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9152674 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540281016 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540813729 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3608 _9152675 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/11534273 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c94622 _d94622 |
||