Algorithms - ESA '98
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Algorithms - ESA '98: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings
Algorithms - ESA '98: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings

Algorithms - ESA '98: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the refereed proceedings of the 6th Annual European Symposium on Algorithms, ESA'97, held in Venice, Italy, in August 1998.The 40 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 131 submissions. The book is divided into sections on data structures, strings and biology, numerical algorithms, geometry, randomized and online algorithms, parallel and distributed algorithms, graph algorithms, and optimization.

Table of Contents:
Invited Lectures.- External Memory Algorithms.- Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper).- Data Structures.- Car-Pooling as a Data Structuring Device: The Soft Heap.- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property.- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.- Strings and Biology.- Augmenting Suffix Trees, with Applications.- Longest Common Subsequence from Fragments via Sparse Dynamic Programming.- Computing the Edit-Distance Between Unrooted Ordered Trees.- Analogs and Duals of the MAST Problem for Sequences and Trees.- Numerical Algorithms.- Complexity Estimates Depending on Condition and Round-Off Error.- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting.- Fast Algorithms for Linear Algebra Modulo N.- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.- Geometry.- Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.- A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract).- Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result.- Two-Center Problems for a Convex Polygon (Extended Abstract).- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice.- Randomized and On-Line Algorithms.- A Fast Random Greedy Algorithm for the Component Commonality Problem.- Maximizing Job Completions Online.- A Randomized Algorithm for Two Servers on the Line (Extended Abstract).- Parallel and Distributed Algorithms I.- On Nonblocking Properties of the Beneš Network.- Adaptability and the Usefulness of Hints (Extended Abstract).- Fault-Tolerant Broadcasting in Radio Networks (ExtendedAbstract).- New Bounds for Oblivious Mesh Routing.- Evaluating Server-Assisted Cache Replacement in the Web.- Graph Algorithms.- Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights.- A Functional Approach to External Graph Algorithms.- Minimal Triangulations for Graphs with “Few” Minimal Separators.- Finding an Optimal Path without Growing the Tree.- An Experimental Study of Dynamic Algorithms for Directed Graphs.- Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme.- Parallel and Distributed Algorithms II.- ?-Stepping : A Parallel Single Source Shortest Path Algorithm.- Improved Deterministic Parallel Padded Sorting.- Analyzing an Infinite Parallel Job Allocation Process.- Nearest Neighbor Load Balancing on Graphs.- Optimization.- 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.- Moving-Target TSP and Related Problems.- Fitting Points on the Real Line and Its Application to RH Mapping.- Approximate Coloring of Uniform Hypergraphs (Extended Abstract).- Techniques for Scheduling with Rejection.- Computer-Aided Way to Prove Theorems in Scheduling.


Best Sellers


Product Details
  • ISBN-13: 9783540648482
  • 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: 524
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3540648488
  • Publisher Date: 29 Jul 1998
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms - ESA '98: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms - ESA '98: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings
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 - ESA '98: 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings

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!