Document - eBookmela
Loading...

Computing and combinatorics : 10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17 | COCOON 2004 (2004 : Cheju-do, Korea), Chwa, Kyung-Yong, 1946-, Munro, J. Ian

Likes0
Telegram icon Share on Telegram

Computing and combinatorics : 10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17

User Rating: Be the first one!

Author: COCOON 2004 (2004 : Cheju-do, Korea), Chwa, Kyung-Yong, 1946-, Munro, J. Ian

Total Files: 18

Media Type: texts

Description

Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004. Proceedings
Author: Kyung-Yong Chwa, J. Ian J. Munro
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-22856-1
DOI: 10.1007/b99243

Table 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
eBookmela
Logo
Register New Account