Wonder Club world wonders pyramid logo
×

Algorithms and Data Structures Book

Algorithms and Data Structures
Algorithms and Data Structures, , Algorithms and Data Structures has a rating of 3 stars
   2 Ratings
X
Algorithms and Data Structures, , Algorithms and Data Structures
3 out of 5 stars based on 2 reviews
5
0 %
4
0 %
3
100 %
2
0 %
1
0 %
Digital Copy
PDF format
1 available   for $99.99
Original Magazine
Physical Format

Sold Out

  • Algorithms and Data Structures
  • Written by author Frank Dehne
  • Published by Springer-Verlag New York, LLC, January 2008
  • This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003.The 40 revised full papers presented together with 4 invited papers were
Buy Digital  USD$99.99

WonderClub View Cart Button

WonderClub Add to Inventory Button
WonderClub Add to Wishlist Button
WonderClub Add to Collection Button

Book Categories

Authors

Towards a theory of algorithms1
k-Restricted rotation with art application to search tree rebalancing2
Heap building bounds14
The multi-radius cover problem24
Parameterized complexity of generalized vertex cover problems36
The complexity of implicit and space efficient priority queues40
Analysis of a class of tries with adaptive multi-digit branching61
Balanced aspect ratio trees revisited73
Improved combinatorial croup testing for real-world problem sizes86
Parameterized counting algorithms for general graph covering problems99
Approximating the online set multicover problems via randomized winnowing110
Max-stretch reduction for tree spanners122
Succinct representation of triangulations with a boundary134
Line-segment intersection made in-place146
Improved fixed-parameter algorithms for two feedback set problems158
Communication-aware processor allocation for supercomputers169
Dynamic hotlinks182
The minimum-area spanning tree problem195
Hinged dissection of polypolyhedra205
Convex recolorings of strings and trees : defnitions, hardness results and algorithms218
Linear time algorithms for generalized edge dominating set problems233
On geometric dilation and halving chords244
Orthogonal subdivisions with low stabbing numbers256
Kinetic and dynamic data structures for convex hulls and upper envelopes269
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length282
A dynamic implicit adjacency labelling schemes for line graphs294
The on-line asymmetric traveling salesman problem306
All-pairs shortest paths with real weights in O(n[superscript 3]/logn) time318
k-Link shortest paths in weighted subdivisions325
Power-saving scheduling for weakly dynamic voltage scaling devices338
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems350
On the vehicle routing problem360
The structure of optimal prefix-free codes in restricted languages : the uniform probability case372
Tradeoffs between branch mispredictions and comparisons for sorting algorithms385
Derandomization of dimensionality reduction and SDP based algorithms396
Subquadratic algorithms for 3SUM409
Near-optimal pricing in near-linear time422
Improved approximation bounds for planar point pattern matching432


Login

  |  

Complaints

  |  

Blog

  |  

Games

  |  

Digital Media

  |  

Souls

  |  

Obituary

  |  

Contact Us

  |  

FAQ

CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!

X
WonderClub Home

This item is in your Wish List

Algorithms and Data Structures, , Algorithms and Data Structures

X
WonderClub Home

This item is in your Collection

Algorithms and Data Structures, , Algorithms and Data Structures

Algorithms and Data Structures

X
WonderClub Home

This Item is in Your Inventory

Algorithms and Data Structures, , Algorithms and Data Structures

Algorithms and Data Structures

WonderClub Home

You must be logged in to review the products

E-mail address:

Password: