Vor Ort
Merkzettel Warenkorb
  • Produktbild: Computing and Combinatorics
  • Produktbild: Computing and Combinatorics
Band 1627

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

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.07.1999

Abbildungen

XV, 494 p.

Herausgeber

Takao Asano + weitere

Verlag

Springer Berlin

Seitenzahl

494

Maße (L/B/H)

23,5/15,5/2,8 cm

Gewicht

774 g

Auflage

1999

Sprache

Englisch

ISBN

978-3-540-66200-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.07.1999

Abbildungen

XV, 494 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

494

Maße (L/B/H)

23,5/15,5/2,8 cm

Gewicht

774 g

Auflage

1999

Sprache

Englisch

ISBN

978-3-540-66200-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computing and Combinatorics
  • Produktbild: Computing and Combinatorics
  • 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.