Computing and Combinatorics

5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings

Häftad, Engelska, 1999

Av Takao Asano, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama, D. T. Lee, Shin-Ichi Nakano

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 5th Annual International Conference on Computing and Combinatorics, COCOON'99, held in Tokyo, Japan in July 1999. The 46 revised papers presented were carefully reviewed and selected from a total of 88 submissions; also included are two invited survey papers. The papers are organized in topical sections on data structures, computational biology, graph drawing, discrete mathematics, graph algorithms, automata and languages, complexity theory and learning, combinatorial optimization, number theory, distributed computing, network routing, computational geometry, online algorithms, rewriting systems, and parallel computing.

Produktinformation

Utgivningsdatum1999-07-07
Mått155 x 235 x 28 mm
Vikt774 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor494
Upplaga1999
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540662006

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Hårdvara inom Data och it
Programmeringsböcker inom Data och it
Nätverk och kommunikation inom Data och it

Invited Talks.- The Web as a Graph: Measurements, Models, and Methods.- Some Observations on the Computational Complexity of Graph Accessibility Problem (Extended Abstract).- Hao Wang Award Paper.- An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.- Data Structures.- Theory of 2-3 Heaps.- An External Memory Data Structure for Shortest Path Queries (Extended Abstract).- Computational Biology.- Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees.- Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations.- Graph Drawing.- An Approximation Algorithm for the Two-Layered Graph Drawing Problem.- Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.- Layout Problems on Lattice Graphs.- Discrete Mathematics.- A New Transference Theorem in the Geometry of Numbers.- On Covering and Rank Problems for Boolean Matrices and Their Applications.- A Combinatorial Algorithm for Pfaffians.- Graph Algorithms 1.- How to Swap a Failing Edge of a Single Source Shortest Paths Tree.- On Bounds for the k-Partitioning of Graphs.- A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.- Automata and Language.- Probabilities to Accept Languages by Quantum Finite Automata.- Distributionally-Hard Languages.- Circuits and Context-Free Languages.- Complexity Theory and Learning.- On the Negation-Limited Circuit Complexity of Merging.- Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy.- Efficient Learning of Some Linear Matrix Languages.- Combinatorial Optimization 1.- Minimizing Mean Response Time in Batch Processing System.- Approximation Algorithms for Bounded Facility Location.- Scheduling Trees onto Hypercubes and Grids Is NP-complete.- Graph Algorithms 2.- Approximations of Weighted Independent Set and Hereditary Subset Problems.- Multi-coloring Trees.- On the Complexity of Approximating Colored-Graph Problems Extended Abstract.- Number Theory.- On the Average Sensitivity of Testing Square-Free Numbers.- Binary Enumerability of Real Numbers (Extended Abstract).- GCD of Many Integers (Extended Abstract).- Distributed Computing.- Multi-party Finite Computations.- Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs.- Combinatorial Optimization 2.- A Dynamic-Programming Bound for the Quadratic Assignment Problem.- A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases.- Network Routing Problems.- On Routing in Circulant Graphs.- Minimum Congestion Embedding of Complete Binary Trees into Tori.- Computational Geometry.- Maximum Stabbing Line in 2D Plane.- Generalized Shooter Location Problem.- Online Algorithms.- A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory.- Using Generalized Forecasts for Online Currency Conversion.- Rewriting Systems.- On S-Regular Prefix-Rewriting Systems and Automatic Structures.- Tractable and Intractable Second-Order Matching Problems.- Parallel Computing.- Efficient Fixed-Size Systolic Arrays for the Modular Multiplication.- Improving Parallel Computation with Fast Integer Sorting.- A Combinatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor.- Combinatorial Optimization 3.- A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.- The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set.