



LEADER 
06546nmm a2200469 u 4500 
001 
EB001884374 
003 
EBX01000000000000001047741 
005 
00000000000000.0 
007 
cr 
008 
191115  eng 
020 


a 9783540486862

100 
1 

a Asano, Takao
e [editor]

245 
0 
0 
a Computing and Combinatorics
h Elektronische Ressource
b 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 2628, 1999, Proceedings
c edited by Takao Asano, Hiroshi Imai, D.T. Lee, Shinichi Nakano, Takeshi Tokuyama

250 


a 1st ed. 1999

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 1999, 1999

300 


a XV, 494 p
b online resource

505 
0 

a 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 kPartitioning of Graphs  A Faster Algorithm for Computing Minimum 5Way and 6Way Cuts in Graphs  Automata and Language  Probabilities to Accept Languages by Quantum Finite Automata  DistributionallyHard Languages  Circuits and ContextFree Languages  Complexity Theory and Learning  On the NegationLimited Circuit Complexity of Merging  SuperPolynomial Versus HalfExponential 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 NPcomplete  Graph Algorithms 2 

505 
0 

a Approximations of Weighted Independent Set and Hereditary Subset Problems  Multicoloring Trees  On the Complexity of Approximating ColoredGraph Problems Extended Abstract  Number Theory  On the Average Sensitivity of Testing SquareFree Numbers  Binary Enumerability of Real Numbers (Extended Abstract)  GCD of Many Integers (Extended Abstract)  Distributed Computing  Multiparty Finite Computations  Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs  Combinatorial Optimization 2  A DynamicProgramming 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 

505 
0 

a A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory  Using Generalized Forecasts for Online Currency Conversion  Rewriting Systems  On SRegular PrefixRewriting Systems and Automatic Structures  Tractable and Intractable SecondOrder Matching Problems  Parallel Computing  Efficient FixedSize Systolic Arrays for the Modular Multiplication  Improving Parallel Computation with Fast Integer Sorting  A Combinatorial Approach to Performance Analysis of a SharedMemory Multiprocessor  Combinatorial Optimization 3  A Fast Approximation Algorithm for TSP with Neighborhoods and RedBlue Separation  The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set

505 
0 

a 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 2EdgeConnected Subgraph Containing a Specified Spanning Tree  Data Structures  Theory of 23 Heaps  An External Memory Data Structure for Shortest Path Queries (Extended Abstract)  Computational Biology  Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Nonuniform Degrees  Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations  Graph Drawing  An Approximation Algorithm for the TwoLayered 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 

653 


a Computer Communication Networks

653 


a Computer graphics

653 


a Programming Techniques

653 


a Computer science

653 


a Computer science / Mathematics

653 


a Computer programming

653 


a Discrete Mathematics in Computer Science

653 


a Computer Graphics

653 


a Algorithms

653 


a Computer networks

653 


a Discrete mathematics

653 


a Theory of Computation

700 
1 

a Imai, Hiroshi
e [editor]

700 
1 

a Lee, D.T.
e [editor]

700 
1 

a Nakano, Shinichi
e [editor]

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

028 
5 
0 
a 10.1007/3540486860

856 
4 
0 
u https://doi.org/10.1007/3540486860?nosfx=y
x Verlag
3 Volltext

082 
0 

a 005.11

520 


a The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON ’99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computing. In response to the call for papers, 88 highquality extended abstracts were submitted internationally, of which 46 were selected for presentation by the p gram committee. Every submitted paper was reviewed by at least three program committee members. Many of these papers represent reports on continuing  search, and it is expected that most of them will appear in a more polished and complete form in scienti c journals. In addition to the regular papers, this v ume contains abstracts of two invited plenary talks by Prabhakar Raghavan and Seinosuke Toda. The conference also included a special talk by Kurt Mehlhorn on LEDA (Library of E cient Data types and Algorithms). The Hao Wang Award (inaugurated at COCOON ’97) is given to honor the paper judged by the program committee to have the greatest scienti c merit. The recipients of the Hao Wang Award 1999 were Hiroshi Nagamochi and Tos hide Ibaraki for their paper \An Approximation for Finding a Smallest 2Edge Connected Subgraph Containing a Speci ed Spanning Tree"
