×
Loading...

Computing and combinatorics : 10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004 : proceedings by COCOON 2004 (2004 : Cheju-do, Korea)

Book Information

TitleComputing and combinatorics : 10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004 : proceedings
CreatorCOCOON 2004 (2004 : Cheju-do, Korea), Chwa, Kyung-Yong, 1946-, Munro, J. Ian
Year2004
PPI300
PublisherBerlin : Springer
LanguageEnglish
Mediatypetexts
SubjectComputer science, Combinatorial analysis, Analyse combinatoire, Informatique, Optimisation combinatoire, Structure de données, Informatique, Analyse combinatoire, Combinatorial analysis, Computer science, Informatique, Analyse combinatoire, Optimisation combinatoire, Structure de données, Berechenbarkeit, Kombinatorik, Theoretische Informatik, Berechenbarkeit, Kombinatorik, Theoretische Informatik, COCOON, Computing, Combinatorics
ISBN354022856X, 9783540228561
Collectionfolkscanomy_miscellaneous, folkscanomy, additional_collections
Uploadersketch
Identifierspringer_10.1007-b99243
Telegram icon Share on Telegram
Download Now

Description

Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004. ProceedingsAuthor: Kyung-Yong Chwa, J. Ian J. Munro Published by Springer Berlin Heidelberg ISBN: 978-3-540-22856-1 DOI: 10.1007/b99243Table of Contents:External Geometric Data Structures The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems Robust Geometric Computation Based on Digital Topology Adjacency of Optimal Regions for Huffman Trees A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs Towards Constructing Optimal Strip Move Sequences Large Triangles in the d-Dimensional Unit-Cube Progress on Maximum Weight Triangulation Coloring Octrees Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes Q-Ary Ulam-Rényi Game with Weighted Constrained Lies Necessary and Sufficient Numbers of Cards for the Transformation Protocol On the Selection and Assignment with Minimum Quantity Commitments Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study Transshipment Through Crossdocks with Inventory and Time Windows Approximated Vertex Cover for Graphs with Perfect Matchings An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts The Worst-Case Time Complexity for Generating All Maximal Cliques Regular Expressions for Languages over Infinite Alphabets, Includes bibliographical references and author index