Buy Algorithms and Computation Book by Rudolf Fleischer
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings(3341 Lecture Notes in Computer Science)
37%
Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings(3341 Lecture Notes in Computer Science)

Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings(3341 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



Available


X
About the Book

This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004.The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.

Table of Contents:
Puzzles, Art, and Magic with Algorithms.- The ABCs of AVDs: Geometric Retrieval Made Simple.- Pareto Optimality in House Allocation Problems.- Property-Preserving Data Reconstruction.- On the Monotone Circuit Complexity of Quadratic Boolean Functions.- Generalized Function Matching.- Approximate Distance Oracles for Graphs with Dense Clusters.- Multicriteria Global Minimum Cuts.- Polyline Fitting of Planar Points Under Min-sum Criteria.- A Generalization of Magic Squares with Applications to Digital Halftoning.- Voronoi Diagrams with a Transportation Network on the Euclidean Plane.- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation.- Poly-APX- and PTAS-Completeness in Standard and Differential Approximation.- Efficient Algorithms for k Maximum Sums.- Equipartitions of Measures by 2-Fans.- Augmenting the Edge-Connectivity of a Spider Tree.- On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks.- Structural Similarity in Graphs.- Flexibility of Steiner Trees in Uniform Orientation Metrics.- Random Access to Advice Strings and Collapsing Results.- Bounding the Payment of Approximate Truthful Mechanisms.- The Polymatroid Steiner Problems.- Geometric Optimization Problems Over Sliding Windows.- On-Line Windows Scheduling of Temporary Items.- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy.- An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.- On the Range Maximum-Sum Segment Query Problem.- An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.- Efficient Job Scheduling Algorithms with Multi-type Contentions.- Superimposing Voronoi Complexes for Shape Deformation.- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.- Guarding Art Galleries by Guarding Witnesses.- On p-Norm Based Locality Measures of Space-Filling Curves.- Composability of Infinite-State Activity Automata.- Error Compensation in Leaf Root Problems.- On Compact and Efficient Routing in Certain Graph Classes.- Randomized Insertion and Deletion in Point Quad Trees.- Diagnosis in the Presence of Intermittent Faults.- Three-Round Adaptive Diagnosis in Binary n-Cubes.- Fast Algorithms for Comparison of Similar Unordered Trees.- GCD of Random Linear Forms.- On the Hardness and Easiness of Random 4-SAT Formulas.- Minimum Common String Partition Problem: Hardness and Approximations.- On the Complexity of Network Synchronization.- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs.- Adaptive Spatial Partitioning for Multidimensional Data Streams.- Paired Pointset Traversal.- Approximated Two Choices in Randomized Load Balancing.- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting.- Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.- The Maximum Agreement of Two Nested Phylogenetic Networks.- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.- New Bounds on Map Labeling with Circular Labels.- Optimal Buffer Management via Resource Augmentation.- Oriented Paths in Mixed Graphs.- Polynomial Deterministic Rendezvous in Arbitrary Graphs.- Distributions of Points and Large Quadrangles.- Cutting Out Polygons with Lines and Rays.- Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.- Inner Rectangular Drawings of Plane Graphs.- Approximating the Minmax Subtree Cover Problem in a Cactus.- Boundary-Optimal Triangulation Flooding.-Exact Computation of Polynomial Zeros Expressible by Square Roots.- Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements.- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.- Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks.- Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search.- Dynamic Tree Cross Products.- Spanners, Weak Spanners, and Power Spanners for Wireless Networks.- Techniques for Indexing and Querying Temporal Observations for a Collection of Objects.- Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices.- The Two-Guard Problem Revisited and Its Generalization.- Canonical Data Structure for Interval Probe Graphs.- Efficient Algorithms for the Longest Path Problem.- Randomized Algorithms for Motif Detection.- Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.- Sweeping Graphs with Large Clique Number.- A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.


Best Sellers


Product Details
  • ISBN-13: 9783540241317
  • 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: 935
  • Returnable: Y
  • Sub Title: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
  • ISBN-10: 3540241310
  • Publisher Date: 03 Dec 2004
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 3341 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings(3341 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings(3341 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 Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings(3341 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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!