Algorithms and computation - Info and Reading Options

The Open Library:

This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.

Open Data:

Title -- Preface -- Organization -- Table of Contents -- Invited Talk (I) -- Future Directions in Computer Science Research -- Invited Talk (II) -- Combinatorial Geometry and Approximation Algorithms -- Invited Talk (III) -- Origami Robots and Star Trek Replicators -- Graph Algorithms (I) -- Strong Conflict-Free Coloring for Intervals -- Introduction -- A k-SCF Coloring Algorithm -- Correctness of Algorithm k-COLOR -- Analysis of Algorithm k-COLOR(I) -- A k-SCF Coloring Algorithm for Hn -- A Quasipolynomial Time Algorithm -- Conclusions, Further Work, and Open Problems -- References -- Closing Complexity Gaps for Coloring Problems on H-Free Graphs -- Introduction -- Classifying Precoloring Extension and 3-List Coloring -- List Coloring for Complete Graphs Minus a Matching -- List 4-Coloring for P6-Free Graphs -- Concluding Remarks -- References -- Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors -- Introduction -- Preliminaries -- Rapid Mixing on Regular Bipartite Graphs -- Proof of the First Part of Theorem 1 -- Rapid Mixing on Graphs with Bounded Common Neighbors -- Proof of the Second Part of Theorem 1 -- References -- Reconfiguration of List L(2, 1)-Labelings in a Graph -- Introduction -- Definitions -- PSPACE-Completeness -- Linear-Time Algorithm -- Sufficient Condition for Trees -- Concluding Remarks -- References -- Online and Streaming Algorithms -- An 8/3 Lower Bound for Online Dynamic Bin Packing -- Introduction -- Preliminaries -- Op-Inc and Op-Comp -- Operation Op-Inc -- Operation Op-Comp -- A 2.5 Lower Bound Using Op-Inc and Op-Comp -- The 8/3 Lower Bound -- Conclusion -- References -- Computing k-center over Streaming Data for Small k -- Introduction -- Preliminaries -- The Case &gt -- 2r -- The Case 2r -- LayerPartition -- DoublingGrid -- Conclusions -- References

Search for “Algorithms and computation” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Algorithms and computation” in Libraries Near You:

Read or borrow “Algorithms and computation” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Algorithms and computation” at a library near you.