Algorithms – ESA 2005
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings

Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This volume contains the 75 contributed papers and the abstracts of the three invited lectures presented at the 13th Annual European Symposium on Al- rithms (ESA 2005), held in Palma de Mallorca, Spain, October 3-6, 2005. The threedistinguishedinvitedspeakerswereGiuseppeF.Italiano,CristopherMoore and Joseph (Se?) Naor. Since 2002,ESA has consisted of two tracks, with separate programcomm- tees, which dealt respectively with - the designandmathematicalanalysis ofalgorithms(the "DesignandAna- sis" track); - real-worldapplications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). Previous ESAs in the current two track format were held in Rome, Italy (2002);Budapest,Hungary(2003);andBergen,Norway(2004).Theproceedings of these symposia were published as Springer's LNCS volumes 2461, 2832, and 3221 respectively. Papers were solicited in all areas of algorithmic research, including but not limited to algorithmic aspects of networks, approximation and on-line al- rithms, computational biology, computational geometry, computational ?nance and algorithmic game theory, data structures, database and information - trieval, external memory algorithms, graph algorithms, graph drawing, machine learning, mobile computing, pattern matching and data compression, quantum computing, and randomized algorithms. The algorithms could be sequential, distributed, or parallel. Submissions were especially encouraged in the area of mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics, and semide?nite programming.

Table of Contents:
Designing Reliable Algorithms in Unreliable Memories.- From Balanced Graph Partitioning to Balanced Metric Labeling.- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism.- Exploring an Unknown Graph Efficiently.- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio.- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut.- Relax-and-Cut for Capacitated Network Design.- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,.- The Complexity of Games on Highly Regular Graphs.- Computing Equilibrium Prices: Does Theory Meet Practice?.- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.- An Algorithm for the SAT Problem for Formulae of Linear Length.- Linear-Time Enumeration of Isolated Cliques.- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs.- Delineating Boundaries for Imprecise Regions.- Exacus: Efficient and Exact Algorithms for Curves and Surfaces.- Min Sum Clustering with Penalties.- Improved Approximation Algorithms for Metric Max TSP.- Unbalanced Graph Cuts.- Low Degree Connectivity in Ad-Hoc Networks.- 5-Regular Graphs are 3-Colorable with Positive Probability.- Optimal Integer Alphabetic Trees in Linear Time.- Predecessor Queries in Constant Time?.- An Algorithm for Node-Capacitated Ring Routing.- On Degree Constrained Shortest Paths.- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time.- Roll Cutting in the Curtain Industry.- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation.- Cache-Oblivious Comparison-Based Algorithms on Multisets.- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation.- Allocating Memory in a Lock-Free Manner.- Generating Realistic Terrains with Higher-Order Delaunay Triangulations.- I/O-Efficient Construction of Constrained Delaunay Triangulations.- Convex Hull and Voronoi Diagram of Additively Weighted Points.- New Tools and Simpler Algorithms for Branchwidth.- Treewidth Lower Bounds with Brambles.- Minimal Interval Completions.- A 2-Approximation Algorithm for Sorting by Prefix Reversals.- Approximating the 2-Interval Pattern Problem.- A Loopless Gray Code for Minimal Signed-Binary Representations.- Efficient Approximation Schemes for Geometric Problems?.- Geometric Clustering to Minimize the Sum of Cluster Sizes.- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.- Packet Routing and Information Gathering in Lines, Rings and Trees.- Jitter Regulation for Multiple Streams.- Efficient c-Oriented Range Searching with DOP-Trees.- Matching Point Sets with Respect to the Earth Mover’s Distance.- Small Stretch Spanners on Dynamic Graphs.- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure.- Experimental Study of Geometric t-Spanners.- Highway Hierarchies Hasten Exact Shortest Path Queries.- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.- Fairness-Free Periodic Scheduling with Vacations.- Online Bin Packing with Cardinality Constraints.- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines.- Engineering Planar Separator Algorithms.- Stxxl: Standard Template Library for XXL Data Sets.- Negative Cycle Detection Problem.- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.- Online View Maintenance Under a Response-Time Constraint.- Online Primal-Dual Algorithms for Coveringand Packing Problems.- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information.- Using Fractional Primal-Dual to Schedule Split Intervals with Demands.- An Approximation Algorithm for the Minimum Latency Set Cover Problem.- Workload-Optimal Histograms on Streams.- Finding Frequent Patterns in a String in Sublinear Time.- Online Occlusion Culling.- Shortest Paths in Matrix Multiplication Time.- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.- Greedy Routing in Tree-Decomposed Graphs.- Making Chord Robust to Byzantine Attacks.- Bucket Game with Applications to Set Multicover and Dynamic Page Migration.- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model.- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs.- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.- Robust Approximate Zeros.- Optimizing a 2D Function Satisfying Unimodality Properties.


Best Sellers


Product Details
  • ISBN-13: 9783540291183
  • 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: 901
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3540291180
  • Publisher Date: 19 Sep 2005
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, 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 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, 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!