Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	August 1999
Genre:	EDV / Informatik
	Algorithm / algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / AlgorithmEngineering / Algorithms / AlgorithmsImplementation / Algorithmus / Combinatorics / ComputationalDiscreteMathematics / datastructure / datastructures / Diskrete Mathematik / EDV / Theorie / Informatik / Mathematik / graphcomputations / Kombinatorik / Mathematik / Netzwerk (elektronisch) / Netzwerk-Hardware / Standards / Theoretische Informatik mehr...
ISBN:	9783540664277
EAN-Code:	9783540664277
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 21 mm
Gewicht:	569 gr
Seiten:	376
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Lectures.- Selecting Problems for Algorithm Evaluation.- BSP Algorithms - "Write Once, Run Anywhere".- Ten Years of LEDA: Some Thoughts.- Contributed Papers.- Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison.- Efficient Implementation of Lazy Suffix Trees.- Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism.- Finding Minimum Congestion Spanning Trees.- Evaluation of an Algorithm for the Transversal Hypergraph Problem.- Construction Heuristics and Domination Analysis for the Asymmetric TSP.- Counting in Mobile Networks: Theory and Experimentation.- Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.- Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.- On-Line Zone Construction in Arrangements of Lines in the Plane.- The Design and Implementation of Planar Maps in CGAL.- An Easy to Use Implementation of Linear Perturbations within Cupgal.- Analysing Cache Effects in Distribution Sorting.- Fast Regular Expression Search.- An Experimental Evaluation of Hybrid Data Structures for Searching.- LEDA-SM: Extending LEDA to Secondary Memory.- A Priority Queue Transform.- Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.- Estimating Large Distances in Phylogenetic Reconstruction.- The Performance of Concurrent Red-Black Tree Algorithms.- Performance Engineering Case Study: Heap Construction.- A Fast and Simple Local Search for Graph Coloring.- BALL: Biochemical Algorithms Library.- An Experimental Study of Priority Queues in External Memory.