Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Thepapersinthisvolumewereselectedforpresentationatthe10thInternational Computing and Combinatorics Conference (COCOON 2004), held on August 17–20, 2004 in Jeju Island, Korea. Previous meetings were held in Xi’an (1995), HongKong(1996),Shanghai(1997),Taipei(1998),Tokyo(1999),Sydney(2000), Guilin (2001), Singapore (2002), and Big Sky (2003). In response to the call for papers, 109 extended abstracts were submitted from 23 countries, of which 46 were accepted. The submitted papers were from Belgium (1), Canada (5), China (6), France (1), Germany (6), Hong Kong (8), India (6), Iran (1), Ireland (1), Israel (4), Italy (2), Japan (17), Korea (23), Mexico (3), New Zealand (1), Poland(1), Russia (1), Singapore (5), Sweden (2), Switzerland (3), Taiwan (2), the UK (1), and the USA (9). Each paper was evaluated by at least three program committee members, with the assistance of referees, as indicated by the referee list found in these proceedings. There were many more acceptable papers than there was space available in the conference schedule, and the program committee’s task was extremely di?cult. In addition to selected papers, the conference also included threeinvitedpresentationsbyLarsArge,JeongHanKim,andKokichiSugihara. We thank all program committee members and their referees for their - cellent work, especially given the demanding time constraints; they gave the conference its distinctive character. We thank all who submitted papers for c- sideration: they all contributed to the high quality of the conference. Finally,wethankallthepeoplewhoworkedhardtoputinplacethelogistical arrangements of the conference — our colleagues and our graduate students. It is their hard work that made the conference possible and enjoyable.

Author(s): Lars Arge (auth.), Kyung-Yong Chwa, J. Ian J. Munro (eds.)
Series: Lecture Notes in Computer Science 3106
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004

Language: English
Pages: 482
Tags: Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computer Communication Networks; Data Structures; Coding and Information Theory; Computer Graphics

Front Matter....Pages -
External Geometric Data Structures....Pages 1-1
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k -SAT Problems....Pages 2-2
Robust Geometric Computation Based on Digital Topology....Pages 3-12
Adjacency of Optimal Regions for Huffman Trees....Pages 13-22
A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs....Pages 23-32
Towards Constructing Optimal Strip Move Sequences....Pages 33-42
Large Triangles in the d -Dimensional Unit-Cube....Pages 43-52
Progress on Maximum Weight Triangulation....Pages 53-61
Coloring Octrees....Pages 62-71
Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes....Pages 72-81
Q -Ary Ulam-Rényi Game with Weighted Constrained Lies....Pages 82-91
Necessary and Sufficient Numbers of Cards for the Transformation Protocol....Pages 92-101
On the Selection and Assignment with Minimum Quantity Commitments....Pages 102-111
Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study....Pages 112-121
Transshipment Through Crossdocks with Inventory and Time Windows....Pages 122-131
Approximated Vertex Cover for Graphs with Perfect Matchings....Pages 132-142
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs....Pages 143-150
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts....Pages 151-160
The Worst-Case Time Complexity for Generating All Maximal Cliques....Pages 161-170
Regular Expressions for Languages over Infinite Alphabets....Pages 171-178
On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations....Pages 179-187
Learning DNFs and Circuits Using Teaching Assistants....Pages 188-197
On the Complexity of Samples for Learning....Pages 198-209
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation....Pages 210-218
Maximization of the Size and the Weight of Schedules of Degradable Intervals....Pages 219-228
Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines....Pages 229-237
Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain....Pages 238-248
Algorithms for Point Set Matching with k -Differences....Pages 249-258
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon....Pages 259-267
The Traveling Salesman Problem with Few Inner Points....Pages 268-277
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application....Pages 278-289
Algorithms for the On-Line Quota Traveling Salesman Problem....Pages 290-299
On the Orthogonal Drawing of Outerplanar Graphs....Pages 300-308
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs....Pages 309-318
New Bounds on the Number of Edges in a k -Map Graph....Pages 319-328
Dynamic Storage Allocation and On-Line Colouring Interval Graphs....Pages 329-338
New Approximation Algorithms for Some Dynamic Storage Allocation Problems....Pages 339-348
k -Center Problems with Minimum Coverage....Pages 349-359
On the Extensions of Solovay-Reducibility....Pages 360-369
The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups....Pages 370-379
Computational Complexity Classification of Partition under Compaction and Retraction....Pages 380-391
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements....Pages 392-401
Fault-Tolerant Meshes with Constant Degree....Pages 402-411
Fault Hamiltonicity of Meshes with Two Wraparound Edges....Pages 412-421
On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm....Pages 422-431
An Efficient Online Algorithm for Square Detection....Pages 432-439
An Efficient Local Alignment Algorithm for Masked Sequences....Pages 440-449
Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard....Pages 450-461
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets....Pages 462-471
Back Matter....Pages -