Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings: 4288 (Lecture Notes in Computer Science, 4288) - Softcover
Synopsis
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India, December 2006. The 73 revised full papers cover algorithms and data structures, online algorithms, approximation algorithm, computational geometry, computational complexity, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
"synopsis" may belong to another edition of this title.
Search results for Algorithms and Computation: 17th International Symposium,...
Stock Image
Algorithms And Computation
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABBB-165489
Stock Image
Algorithms And Computation
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEOCT25-322848
Stock Image
Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings (Lecture Notes in Computer Science, 4288)
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: Used. pp. xx + 766 1st Edition. Seller Inventory # 26302165
Stock Image
Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings (Lecture Notes in Computer Science, 4288)
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: Used. pp. xx + 766 Illus. Seller Inventory # 7545738
Buy Used
£ 87.07
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings (Lecture Notes in Computer Science, 4288)
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: Used. pp. xx + 766. Seller Inventory # 18302175
Seller Image
Algorithms and Computation
Published by
Springer Berlin Heidelberg Dez 2006, 2006
ISBN 10: 3540496947
ISBN 13: 9783540496946
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India, December 2006. The 73 revised full papers cover algorithms and data structures, online algorithms, approximation algorithm, computational geometry, computational complexity, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography. 788 pp. Englisch. Seller Inventory # 9783540496946
Seller Image
Algorithms and Computation
Published by
Springer Berlin Heidelberg, 2006
ISBN 10: 3540496947
ISBN 13: 9783540496946
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India, December 2006. The 73 revised full papers cover algorithms and data structures, online algorithms, appro. Seller Inventory # 4891372
Buy New
£ 82.22
£ 42.38 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Algorithms and Computation: 17th International Symposium, ISAAC 2006 Kolkata, India, December 18-20, 2006 Proceedings
Published by
Springer-Verlag New York Inc, 2007
ISBN 10: 3540496947
ISBN 13: 9783540496946
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 1st edition. 763 pages. 9.00x5.75x1.00 inches. In Stock. Seller Inventory # 3540496947
Buy New
£ 119.41
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Algorithms and Computation | 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Algorithms and Computation | 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings | Tetsuo Asano | Taschenbuch | Englisch | 2006 | Springer | EAN 9783540496946 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu. Seller Inventory # 102127925
Seller Image
Algorithms and Computation
Published by
Springer, Springer Dez 2006, 2006
ISBN 10: 3540496947
ISBN 13: 9783540496946
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Talks.- Stable Matching Problems.- Delaunay Meshing of Surfaces.- Best Paper 2006.- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.- Best Student Paper 2006.- Branching and Treewidth Based Exact Algorithms.- Session 1A: Algorithms and Data Structures.- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees.- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.- Flexible Word Design and Graph Labeling.- Session 1B: Online Algorithms.- Frequency Allocation Problems for Linear Cellular Networks.- Finite-State Online Algorithms and Their Automated Competitive Analysis.- Offline Sorting Buffers on Line.- Session 2A: Approximation Algorithms.- Approximating Tree Edit Distance Through String Edit Distance.- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.- Improved Approximation for Single-Sink Buy-at-Bulk.- Approximability of Partitioning Graphs with Supply and Demand.- Session 2B: Graphs.- Convex Grid Drawings of Plane Graphs with Rectangular Contours.- Algorithms on Graphs with Small Dominating Targets.- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems.- On Estimating Path Aggregates over Streaming Graphs.- Session 3A: Computational Geometry.- Diamond Triangulations Contain Spanners of Bounded Degree.- Optimal Construction of the City Voronoi Diagram.- Relations Between Two Common Types of Rectangular Tilings.- Quality Tetrahedral Mesh Generation for Macromolecules.- On Approximating the TSP with Intersecting Neighborhoods.- Session 3B: Computational Complexity.- Negation-Limited Complexity of Parity and Inverters.- The Complexity of Quasigroup Isomorphism and the MinimumGenerating Set Problem.- Inverse HAMILTONIAN CYCLE and Inverse 3-DMATCHING Are coNP-Complete.- Parameterized Problems on Coincidence Graphs.- On 2-Query Codeword Testing with Near-Perfect Completeness.- Session 4A: Algorithms and Data Structures.- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance.- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications.- On Locating Disjoint Segments with Maximum Sum of Densities.- Two-Tier Relaxed Heaps.- Session 4B: Games and Networks.- The Interval Liar Game.- How Much Independent Should Individual Contacts Be to Form a Small-World .- Faster Centralized Communication in Radio Networks.- On the Runtime and Robustness of Randomized Broadcasting.- Session 5A: Combinatorial Optimization and Computational Biology.- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency.- Non-cooperative Facility Location and Covering Games.- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications.- Algorithms for Computing Variants of the Longest Common Subsequence Problem.- Session 5B: Graphs.- Constructing Labeling Schemes Through Universal Matrices.- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.- Analyzing Disturbed Diffusion on Networks.- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs.- On Isomorphism and Canonization of Tournaments and Hypertournaments.- Session 6A: Algorithms and Data Structures.- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem.- Deterministic Random Walks on the Two-Dimensional Grid.-Improving Time and Space Complexity for Compressed Pattern Matching.- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.- Session 6B: Graphs.- A Simple Message Passing Algorithm for Graph Partitioning Problems.- Minimal Interval Completion Through Graph Exploration.- Balanced Cut Approximation in R. Seller Inventory # 9783540496946