Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings(Theoretical Computer Science and General Issues)
Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings(Theoretical Computer Science and General Issues)

Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings(Theoretical Computer Science and General Issues)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

The papers in this volume were presented at the 10th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place August 15 - 17, 2007, at Dalhousie University, Halifax, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT 1988 and WADS 1989. From 142 submissions, the Program Committee selected 54 papers for presentation at the workshop. In addition, invited lectures were given by the following dist- guished researchers: Je? Erickson (University of Illinois at Urbana-Champaign) and Mike Langston (University of Tennessee). On behalf of the Program Committee, we would like to express our sincere appreciation to the many persons whose e?ort contributed to making WADS 2007 a success. These include the invited speakers, members of the Steering and ProgramCommittees, the authorswho submitted papers, andthe manyreferees who assisted the Program Committee. We are indebted to Gerardo Reynaga for installing and modifying the submission software, maintaining the submission server and interacting with authors as well as for helping with the preparation of the program.

Table of Contents:
Session 1.- Finding Small Holes.- Session 2A.- Approximate Range Searching: The Absolute Model.- Orthogonal Range Searching in Linear and Almost-Linear Space.- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere.- Session 2B.- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity.- Approximating the Maximum Sharing Problem.- The Stackelberg Minimum Spanning Tree Game.- Session 3A.- Edges and Switches, Tunnels and Bridges.- How to Draw a Clustered Tree.- Drawing Colored Graphs on Colored Points.- Session 3B.- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric.- Priority Queues Resilient to Memory Faults.- Simple and Space-Efficient Minimal Perfect Hash Functions.- Session 4A.- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems.- Optimization for First Order Delaunay Triangulations.- Session 4B.- Constant Factor Approximations for the Hotlink Assignment Problem.- Approximation Algorithms for the Sex-Equal Stable Marriage Problem.- A Stab at Approximating Minimum Subadditive Join.- Session 5.- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets.- Session 6A.- Flooding Countries and Destroying Dams.- I/O-Efficient Flow Modeling on Fat Terrains.- Computing the Visibility Map of Fat Objects.- Session 6B.- Independent Sets in Bounded-Degree Hypergraphs.- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon.- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time.- Session 7A.- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.-Spanners for Geometric Intersection Graphs.- On Generalized Diamond Spanners.- Session 7B.- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.- On the Robustness of Graham’s Algorithm for Online Scheduling.- Improved Results for a Memory Allocation Problem.- Session 8A.- Computational and Structural Advantages of Circular Boundary Representation.- Alpha-Beta Witness Complexes.- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra.- Session 8B.- Fixed-Parameter Tractability for Non-Crossing Spanning Trees.- Improved Algorithms for the Feedback Vertex Set Problems.- Kernelization Algorithms for d-Hitting Set Problems.- Session 9A.- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points.- Maximizing Maximal Angles for Plane Straight-Line Graphs.- Cuttings for Disks and Axis-Aligned Rectangles.- Session 9B.- Kernelization and Complexity Results for Connectivity Augmentation Problems.- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.- Branch and Recharge: Exact Algorithms for Generalized Domination.- Session 10A.- On Computing the Centroid of the Vertices of an Arrangement and Related Problems.- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p.- Session 10B.- Faster Approximation of Distances in Graphs.- Approximate Shortest Paths Guided by a Small Index.- Session 11A.- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model.- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field.- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality.- On Euclidean Vehicle Routing with Allocation.- Session 11B.- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets.- Range Non-overlappingIndexing and Successive List Indexing.- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters.- Dynamic TCP Acknowledgment with Sliding Window.


Best Sellers


Product Details
  • ISBN-13: 9783540739487
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Depth: 25
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Spine Width: 25 mm
  • Weight: 1694 gr
  • ISBN-10: 3540739483
  • Publisher Date: 30 Jul 2007
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 664
  • Returnable: Y
  • Series Title: 4619 Lecture Notes in Computer Science
  • Sub Title: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings(Theoretical Computer Science and General Issues)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings(Theoretical Computer Science and General Issues)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA