Share on TelegramComputing and combinatorics : 10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17
Author: COCOON 2004 (2004 : Cheju-do, Korea), Chwa, Kyung-Yong, 1946-, Munro, J. Ian
Added by: sketch
Added Date: 2015-12-29
Language: eng
Subjects: Computer 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
Publishers: Berlin : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 354022856X, 9783540228561
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 246.65 MB
PDF Size: 4.85 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 487
Views: 537
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 09:20:54
Size: 13.60 KB
Description
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
