Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings(2125 Lecture Notes in Computer Science)
36%
Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings(2125 Lecture Notes in Computer Science)

Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings(2125 Lecture Notes in Computer Science)

          
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 Seventh Workshop on Al- rithms and Data Structures (WADS 2001). The workshop took place August 8-10, 2001 in Providence, Rhode Island, USA. The workshop alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT '88 and WADS '89. In response to the call for papers, 89 papers were submitted. From these submissions, the program committee selected 40 papers for presentation at the workshop. In addition invited plenary lectures were given by the following - stinguished researchers: Mikhail J. Atallah, F. Thomson Leighton, and Mihalis Yannakakis. On behalf of the program committee, we would like to express our apprec- tion to the invited speakers and to all the authors who submitted papers. August 2001 Frank Dehne J.. org-Rudiger .. Sack Roberto Tamassia Organization Conference Chair Roberto Tamassia (Brown) Program Committee Chairs Frank Dehne (Carleton) J.. org-Rudiger .. Sack (Carleton) Roberto Tamassia (Brown) Program Committee Alberto Apostolico (Purdue, Padova) Giuseppe Liotta (Perugia) Timothy Chan (Waterloo) Ernst W. Mayr (Munc .. hen) Bruno Codenotti (IMC) Joseph S. B. Mitchell (SUNY) Giuseppe Di Battista (Roma Tre) Stefan N.. aher (Trier) Shlomi Dolev (Ben-Gurion) Takao Nishizeki (Tohoku) Martin Farach-Colton Viktor K. Prasanna (USC) (Rutgers, Google) Enrico Puppo (Genova) Pierre Fraigniaud (LRI) Jose Rolim (Geneva) Harold N. Gabow (Colorado) Jack Snoeyink (UNC) Sally A. Goldman (Washington) Ioannis G. Tollis (UTD) Michael T.

Table of Contents:
Session 1 - Invited Talk.- Approximation of Multiobjective Optimization Problems.- Session 2A.- Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.- Optimal Möbius Transformations for Information Visualization and Meshing.- Session 2B.- Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming.- On the Complexity of Scheduling Conditional Real-Time Code.- Session 3A.- Time Responsive External Data Structures for Moving Points.- Voronoi Diagrams for Moving Disks and Applications.- Session 3B.- Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.- Deciding Clique-Width for Graphs of Bounded Tree-Width.- Session 4A.- Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions.- Optimization over Zonotopes and Training Support Vector Machines.- Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.- Session 4B.- Seller-Focused Algorithms for Online Auctioning.- Competitive Analysis of the LRFU Paging Algorithm.- Admission Control to Minimize Rejections.- Session 5 - Invited Talk.- Secure Multi-party Computational Geometry.- Session 6A.- The Grid Placement Problem.- On the Reflexivity of Point Sets.- Session 6B.- A 7/8-Approximation Algorithm for Metric Max TSP.- Approximating Multi-objective Knapsack Problems.- Session 7A.- Visual Ranking of Link Structures.- A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs.- Session 7B.- Short and Simple Labels for Small Distances and Other Functions.- Fast Boolean Matrix Multiplication for Highly Clustered Data.- Session 8A.- Partitioning Colored Point Sets into Monochromatic Parts.- The Analysis of a Probabilistic Approach to Nearest Neighbor Searching.- I/O-Efficient Shortest PathQueries in Geometric Spanners.- Session 8B.- Higher-Dimensional Packing with Order Constraints.- Bin Packing with Item Fragmentation.- Practical Approximation Algorithms for Separable Packing Linear Programs.- Session 9 - Invited Talk.- The Challenges of Delivering Content on the Internet.- Session 10A.- Upward Embeddings and Orientations of Undirected Planar Graphs.- An Approach for Mixed Upward Planarization.- Session 10B.- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.- Computing Phylogenetic Roots with Bounded Degrees and Errors.- Session 11A.- A Decomposition-Based Approach to Layered Manufacturing.- When Can You Fold a Map?.- Session 11B.- Search Trees with Relaxed Balance and Near-Optimal Height.- Succinct Dynamic Data Structures.- Session 12A.- Optimal Algorithms for Two-Guard Walkability of Simple Polygons.- Movement Planning in the Presence of Flows.- Session 12B.- Small Maximal Independent Sets and Faster Exact Graph Coloring.- On External-Memory Planar Depth First Search.


Best Sellers


Product Details
  • ISBN-13: 9783540424239
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 492
  • Returnable: Y
  • Spine Width: 26 mm
  • Weight: 698 gr
  • ISBN-10: 3540424237
  • Publisher Date: 25 Jul 2001
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2125 Lecture Notes in Computer Science
  • Sub Title: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 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: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings(2125 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings(2125 Lecture Notes in Computer Science)
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: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings(2125 Lecture Notes in Computer Science)

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