Algorithms - ESA 2008
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings(Theoretical Computer Science and General Issues)
Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings(Theoretical Computer Science and General Issues)

Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings(Theoretical Computer Science and General Issues)


     0     
5
4
3
2
1



International Edition


X
About the Book

This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.

Table of Contents:
Invited Lectures.- Flexible Path Planning Using Corridor Maps.- A Bridging Model for Multi-core Computing.- Contributed Papers.- Robust Kinetic Convex Hulls in 3D.- On Dominance Reporting in 3D.- Stabbing Convex Polygons with a Segment or a Polygon.- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers.- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.- Cache-Oblivious Red-Blue Line Segment Intersection.- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs.- Straight Skeletons of Three-Dimensional Polyhedra.- Randomized Competitive Analysis for Two-Server Problems.- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra.- Approximating Multi-criteria Max-TSP.- An Integer Programming Algorithm for Routing Optimization in IP Networks.- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.- A Practical Quicksort Algorithm for Graphics Processors.- Bloomier Filters: A Second Look.- Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy.- A New Approach to Exact Crossing Minimization.- A Characterization of 2-Player Mechanisms for Scheduling.- A Local-Search 2-Approximation for 2-Correlation-Clustering.- The Alcuin Number of a Graph.- Time-Dependent SHARC-Routing.- Detecting Regular Visit Patterns.- Improved Approximation Algorithms for Relay Placement.-Selfish Bin Packing.- Improved Randomized Results for That Interval Selection Problem.- Succinct Representations of Arbitrary Graphs.- Edge Coloring and Decompositions of Weighted Graphs.- The Complexity of Sorting with Networks of Stacks and Queues.- Faster Steiner Tree Computation in Polynomial-Space.- Fitting a Step Function to a Point Set.- Faster Swap Edge Computation in Minimum Diameter Spanning Trees.- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem.- An Optimal Dynamic Spanner for Doubling Metric Spaces.- RFQ: Redemptive Fair Queuing.- Range Medians.- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves.- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison.- On the Complexity of Optimal Hotlink Assignment.- Oblivious Randomized Direct Search for Real-Parameter Optimization.- Path Minima in Incremental Unrooted Trees.- Improved Competitive Performance Bounds for CIOQ Switches.- Two-Stage Robust Network Design with Exponential Scenarios.- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.- More Robust Hashing: Cuckoo Hashing with a Stash.- Better and Simpler Approximation Algorithms for the Stable Marriage Problem.- Edit Distances and Factorisations of Even Permutations.- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.- Facility Location in Dynamic Geometric Data Streams.- The Effects of Local Randomness in the Adversarial Queueing Model.- Parallel Imaging Problem.- An Online Algorithm for Finding the Longest Previous Factors.- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.- Improved BDD Algorithms for the Simulation of Quantum Circuits.- Mobile Route Planning.- How Reliable Are Practical Point-in-PolygonStrategies?.- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach.- Approximability of Average Completion Time Scheduling on Unrelated Machines.- Relative Convex Hulls in Semi-dynamic Subdivisions.- An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms.- On the Size of the 3D Visibility Skeleton: Experimental Results.- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions.- Deterministic Sampling Algorithms for Network Design.


Best Sellers


Product Details
  • ISBN-13: 9783540877431
  • 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: 844
  • Series Title: 5193 Lecture Notes in Computer Science
  • Sub Title: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings
  • ISBN-10: 3540877436
  • Publisher Date: 18 Sep 2008
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, 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 - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, 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!