Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings (Lecture Notes in Computer Science, 2906)

This Volume Contains The Proceedings Of The 14th Annual International S- Posium On Algorithms And Computation (isaac 2003), Held In Kyoto, Japan, 15–17 December 2003. In The Past, It Was Held In Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), And Vancouver (2002). Isaacisanannualinternationalsymposiumthatcoverstheverywiderange 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 Our Call For Papers, We Received Unexpectedly Many Subm- Sions, 207 Papers. The Task Of Selecting The Papers In This Volume Was Done By Our Program Committee And Referees. After A Thorough Review Process, The Committee Selected 73 Papers. The Selection Was Done On The Basis Of Originality And Relevance To The ?eld Of Algorithms And Computation. We Hope All Accepted Papers Will Eventally Appear In Scienti?c Journals In More Polished Forms. The Best Paper Award Was Given For “on The Geometric Dilation Of Finite Point Sets” To Annette Ebbers-baumann, Ansgar Grune ¨ And Rolf Klein. Two Eminent Invited Speakers, Prof. Andrew Chi-chih Yao Of Princeton University And Prof. Takao Nishizeki Of Tohoku University, Contributed To This Proceedings. Invited Talk -- Interactive Proofs For Quantum Computation -- Drawing Plane Graphs -- 1a Computational Geometry I -- Linear Time Algorithm For Approximating A Curve By A Single-peaked Curve -- A Dynamic Dictionary For Priced Information With Application -- Voronoi Diagram In The Flow Field -- Polygonal Path Approximation: A Query Based Approach -- 1b Graph And Combinatorial Algorithms I -- A Vertex Incremental Approach For Dynamically Maintaining Chordal Graphs -- Finding The Maximum Common Subgraph Of A Partial K-tree And A Graph With A Polynomially Bounded Number Of Spanning Trees -- Hotlink Enhancement Algorithms For Web Directories -- Finding A Length-constrained Maximum-density Path In A Tree -- 2a Computational Complexity I -- The Intractability Of Computing The Hamming Distance -- Infinitely-often Autoreducible Sets -- Limiting Negations In Bounded-depth Circuits: An Extension Of Markov’s Theorem -- Computational Complexity Measures Of Multipartite Quantum Entanglement --^ 2b Graph And Combinatorial Algorithms Ii -- A New Simple Algorithm For The Maximum-weight Independent Set Problem On Circle Graphs -- Polynomial Time 2-approximation Algorithms For The Minmax Subtree Cover Problem -- Labeled Search Trees And Amortized Analysis: Improved Upper Bounds For Np-hard Problems -- A New Translation From Semi-extended Regular Expressions Into Nfas And Its Application To An Approximate Matching Problem -- 3a Quantum Computation -- The Quantum Query Complexity Of 0-1 Knapsack And Associated Claw Problems -- Non-interactive Quantum Perfect And Statistical Zero-knowledge -- Quantum Merlin-arthur Proof Systems: Are Multiple Merlins More Helpful To Arthur? -- A Faster Lattice Reduction Method Using Quantum Search -- 3b Graph And Combinatorial Algorithms Iii -- Three Sorting Algorithms Using Priority Queues -- Lower Bounds On Correction Networks -- Approximate Regular Expression Searching With Arbitrary Integer Weights --^ Constructing Compressed Suffix Arrays With Large Alphabets -- 4a Computational Geometry Ii -- On The Geometric Dilation Of Finite Point Sets -- On Computing All Immobilizing Grasps Of A Simple Polygon With Few Contacts -- Optimal Point Set Projections Onto Regular Grids -- 4b Combinatorial Optimization I -- An Approximation Algorithm For Dissecting A Rectangle Into Rectangles With Specified Areas -- A Faster Algorithm For Two-variable Integer Programming -- Efficient Algorithms For Generation Of Combinatorial Covering Suites -- 5a Scheduling -- A Better Approximation For The Two-machine Flowshop Scheduling Problem With Time Lags -- On Minimizing Average Weighted Completion Time: A Ptas For The Job Shop Problem With Release Dates -- Online Scheduling Of Parallel Jobs With Dependencies On 2-dimensional Meshes -- 5b Computational Biology --^ Efficient Algorithms For Descendent Subtrees Comparison Of Phylogenetic Trees With Applications To Co-evolutionary Classifications In Bacterial Genome -- Settling The Intractability Of Multiple Alignment -- Efficient Algorithms For Optimizing Whole Genome Alignment With Noise -- 6a Computational Geometry Iii -- Segmenting Doughnut-shaped Objects In Medical Images -- On The Locality Properties Of Space-filling Curves -- Geometric Restrictions On Producible Polygonal Protein Chains -- Symmetric Layout Of Disconnected Graphs -- 6b Graph And Combinatorial Algorithms Iv -- Approximation Hardness Of Minimum Edge Dominating Set And Minimum Maximal Matching -- Enumerating Global Roundings Of An Outerplanar Graph -- Augmenting Forests To Meet Odd Diameter Requirements -- On The Existence And Determination Of Satisfactory Partitions In A Graph -- 7a Distributed And Parallel Algorithms -- A Turn Function Scheme Realized In The Asynchronous Single-writer/multi-reader Shared Memory Model --^ An Optimal Parallel Algorithm For C-vertex-ranking Of Trees -- 7b Graph And Combinatorial Algorithms V -- The Student-project Allocation Problem -- Algorithms For Enumerating Circuits In Matroids -- A Generalized Gale-shapley Algorithm For A Discrete-concave Stable-marriage Model -- 8a Data Structure -- Succinct Data Structures For Searchable Partial Sums -- Range Mode And Range Median Queries On Lists And Trees -- Quasi-perfect Minimally Adaptive Q-ary Search With Unreliable Tests -- New Ways To Construct Binary Search Trees -- 8b Graph And Combinatorial Algorithms Vi -- Improved Approximation Algorithms For Optimization Problems In Graphs With Superlogarithmic Treewidth -- Biconnectivity On Symbolically Represented Graphs: A Linear Solution -- A Dynamic Data Structure For Maintaining Disjoint Paths Information In Digraphs -- Deterministic Algorithm For The T-threshold Set Problem -- 9a Combinatorial And Network Optimization -- Energy-efficient Wireless Network Design --^ Wavelength Conversion In Shortest-path All-optical Networks -- A Heuristic For The Stacker Crane Problem On Trees Which Is Almost Surely Exact -- Flexible Train Rostering -- 9b Computational Complexity And Cryptography -- Counting Complexity Classes Over The Reals I: The Additive Case -- Some Properties Of One-pebble Turing Machines With Sublogarithmic Space -- Hypergraph Decomposition And Secret Sharing -- A Promising Key Agreement Protocol -- 10a Game Theory And Randomized Algorithm -- Rapid Mixing Of Several Markov Chains For A Hard-core Model -- Polynomial Time Approximate Sampler For Discretized Dirichlet Distribution -- Fair Cost Allocations Under Conflicts — A Game-theoretic Point Of View — -- Equilibria For Networks With Malicious Users -- 10b Algebraic And Arithmetic Computation -- Quasi-optimal Arithmetic For Quaternion Polynomials -- Upper Bounds On The Complexity Of Some Galois Theory Problems -- Unfolded Modular Multiplication --^ Gauss Period, Sparse Polynomial, Redundant Basis, And Efficient Exponentiation For A Class Of Finite Fields With Small Characteristic. Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (eds.). Includes Bibliographical References And Index. Also Available Via The World Wide Web. Front Matter....Pages - Interactive Proofs for Quantum Computation....Pages 1-1 Drawing Plane Graphs....Pages 2-5 Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve....Pages 6-15 A Dynamic Dictionary for Priced Information with Application....Pages 16-25 Voronoi Diagram in the Flow Field....Pages 26-35 Polygonal Path Approximation: A Query Based Approach....Pages 36-46 A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs....Pages 47-57 Finding the Maximum Common Subgraph of a Partial k -Tree and a Graph with a Polynomially Bounded Number of Spanning Trees....Pages 58-67 Hotlink Enhancement Algorithms for Web Directories....Pages 68-77 Finding a Length-Constrained Maximum-Density Path in a Tree....Pages 78-87 The Intractability of Computing the Hamming Distance....Pages 88-97 Infinitely-Often Autoreducible Sets....Pages 98-107 Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem....Pages 108-116 Computational Complexity Measures of Multipartite Quantum Entanglement....Pages 117-128 A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs....Pages 129-137 Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem....Pages 138-147 Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems....Pages 148-157 A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem....Pages 158-167 The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems....Pages 168-177 Non-interactive Quantum Perfect and Statistical Zero-Knowledge....Pages 178-188 Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?....Pages 189-198 A Faster Lattice Reduction Method Using Quantum Search....Pages 199-208 Three Sorting Algorithms Using Priority Queues....Pages 209-220 Lower Bounds on Correction Networks....Pages 221-229 Approximate Regular Expression Searching with Arbitrary Integer Weights....Pages 230-239 Constructing Compressed Suffix Arrays with Large Alphabets....Pages 240-249 On the Geometric Dilation of Finite Point Sets....Pages 250-259 On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts....Pages 260-269 Optimal Point Set Projections onto Regular Grids....Pages 270-279 An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas....Pages 280-289 A Faster Algorithm for Two-Variable Integer Programming....Pages 290-299 Efficient Algorithms for Generation of Combinatorial Covering Suites....Pages 300-308 A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags....Pages 309-318 On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates....Pages 319-328 Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes....Pages 329-338 Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome....Pages 339-351 Settling the Intractability of Multiple Alignment....Pages 352-363 Efficient Algorithms for Optimizing Whole Genome Alignment with Noise....Pages 364-374 Segmenting Doughnut-Shaped Objects in Medical Images....Pages 375-384 On the Locality Properties of Space-Filling Curves....Pages 385-394 Geometric Restrictions on Producible Polygonal Protein Chains....Pages 395-404 Symmetric Layout of Disconnected Graphs....Pages 405-414 Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching....Pages 415-424 Enumerating Global Roundings of an Outerplanar Graph....Pages 425-433 Augmenting Forests to Meet Odd Diameter Requirements....Pages 434-443 On the Existence and Determination of Satisfactory Partitions in a Graph....Pages 444-453 A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model....Pages 454-463 An Optimal Parallel Algorithm for c -Vertex-Ranking of Trees....Pages 464-473 The Student-Project Allocation Problem....Pages 474-484 Algorithms for Enumerating Circuits in Matroids....Pages 485-494 A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model....Pages 495-504 Succinct Data Structures for Searchable Partial Sums....Pages 505-516 Range Mode and Range Median Queries on Lists and Trees....Pages 517-526 Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests....Pages 527-536 New Ways to Construct Binary Search Trees....Pages 537-543 Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth....Pages 544-553 Biconnectivity on Symbolically Represented Graphs: A Linear Solution....Pages 554-564 A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs....Pages 565-574 Deterministic Algorithm for the t -Threshold Set Problem....Pages 575-584 Energy-Efficient Wireless Network Design....Pages 585-594 Wavelength Conversion in Shortest-Path All-Optical Networks....Pages 595-604 A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact....Pages 605-614 Flexible Train Rostering....Pages 615-624 Counting Complexity Classes over the Reals I: The Additive Case....Pages 625-634 Some Properties of One-Pebble Turing Machines with Sublogarithmic Space....Pages 635-644 Hypergraph Decomposition and Secret Sharing....Pages 645-654 A Promising Key Agreement Protocol....Pages 655-662 Rapid Mixing of Several Markov Chains for a Hard-Core Model....Pages 663-675 Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution....Pages 676-685 Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View —....Pages 686-695 Equilibria for Networks with Malicious Users....Pages 696-704 Quasi-optimal Arithmetic for Quaternion Polynomials....Pages 705-715 Upper Bounds on the Complexity of Some Galois Theory Problems....Pages 716-725 Unfolded Modular Multiplication....Pages 726-735 Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic....Pages 736-745 Back Matter....Pages - Annotation This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].