Algorithms and computation : 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010 : proceedings
著者
書誌事項
Algorithms and computation : 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010 : proceedings
（Lecture notes in computer science, 6506-6507）
Springer, c2010
- pt. 1
- pt. 2
大学図書館所蔵 全8件
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya,HongKong,Beijing,Cairns,Osaka,Singapore,Taejon,Chennai,Taipei, Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee's task was extremely di?cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference.
Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,were prepared with selected papers from ISAAC 2010. The best paper award was given to "From Holant to #CSP and Back: c DichotomyforHolant Problems"byJin-YiCai,SangxiaHuangandPinyanLu, and the best student paper award to "Satis?ability with Index Dependency" by Hongyu Liang and Jing He. Two eminent invited speakers,David Eppstein from UniversityofCalifornia,Irvine,andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume.
目次
Session 6A. Data Structure and Algorithm II.- D2-Tree: A New Overlay with Deterministic Bounds.- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets.- Dynamic Range Reporting in External Memory.- A Cache-Oblivious Implicit Dictionary with the Working Set Property.- Session 6B. Graph Algorithm II.- The (p,q)-total Labeling Problem for Trees.- Drawing a Tree as a Minimum Spanning Tree Approximation.- k-cyclic Orientations of Graphs.- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.- Session 7A. Computational Geometry II.- Maximum Overlap of Convex Polytopes under Translation.- Approximate Shortest Homotopic Paths in Weighted Regions.- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane.- Session 7B. Graph Coloring II.- Approximation and Hardness Results for the Maximum Edge q-coloring Problem.- 3-Colouring AT-Free Graphs in Polynomial Time.- On Coloring Graphs without InducedForests.- Session 8A. Approximation Algorithm II.- On the Approximability of the Maximum Interval Constrained Coloring Problem.- Approximability of Constrained LCS.- Approximation Algorithms for the Multi-Vehicle Scheduling Problem.- On Greedy Algorithms for Decision Trees.- Session 8B. Online Algorithm.- Single and Multiple Device DSA Problem, Complexities and Online Algorithms.- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications.- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing.- On the Continuous CNN Problem.- Session 9A. Scheduling.- Policies for Periodic Packet Routing.- Increasing Speed Scheduling and Flow Scheduling.- A Tighter Analysis of Work Stealing.- Approximating the Traveling Tournament Problem with Maximum Tour Length 2.- Session 9B. Data Structure and Algorithm III.- Alphabet Partitioning for Compressed Rank/Select and Applications.- Entropy-Bounded Representation of Point Grids.- Identifying ApproximatePalindromes in Run-Length Encoded Strings.- Session 10A. Graph Algorithm III.- Minimum Cost Partitions of Trees with Supply and Demand.- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application.- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization.- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.- Session 10B. Computational Geometry III.- Testing Simultaneous Planarity When the Common Graph Is 2-Connected.- Computing the Discrete Fréchet Distance with Imprecise Input.- Connectivity Graphs of Uncertainty Regions.- ?/2-Angle Yao Graphs Are Spanners.- Identifying Shapes Using Self-assembly.
「Nielsen BookData」 より