Cover Image
Read Now

Algorithm Theory - SWAT 2000 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings

Bibliographic Details
Other Authors: Halldorsson, Magnus M. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2000, 2000
Edition:1st ed. 2000
Series:Lecture Notes in Computer Science
Subjects:
Computer Communication Networks
Artificial Intelligence / Data Processing
Programming Techniques
Computer Science
Computer Programming
Algorithms
Computer Networks 
Discrete Mathematics
Theory Of Computation
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04316nmm a2200409 u 4500
001 EB000656134
003 EBX01000000000000000509216
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540449850 
100 1 |a Halldorsson, Magnus M.  |e [editor] 
245 0 0 |a Algorithm Theory - SWAT 2000  |h Elektronische Ressource  |b 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings  |c edited by Magnus M. Halldorsson 
250 |a 1st ed. 2000 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2000, 2000 
300 |a XI, 564 p  |b online resource 
505 0 |a Efficient Expected-Case Algorithms for Planar Point Location -- A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon -- Strings and Algorithm Engineering -- The Enhanced Double Digest Problem for DNA Physical Mapping -- Generalization of a Suffix Tree for RNA Structural Pattern Matching -- Efficient Computation of All Longest Common Subsequences -- A Blocked All-Pairs Shortest-Paths Algorithm -- External Memory Algorithms -- On External-Memory MST, SSSP, and Multi-way Planar Graph Separation -- I/O-Space Trade-Offs -- Optimization -- Optimal Flow Aggregation -- On the Complexities of the Optimal Rounding Problems of Sequences and Matrices -- On the Complexity of the Sub-permutation Problem -- Parallel Attribute-Efficient Learning of Monotone Boolean Functions -- Distributed Computing and Fault-Tolerance -- Max- and Min-Neighborhood Monopolies -- Optimal Adaptive Fault Diagnosis of Hypercubes -- Fibonacci Correction Networks --  
505 0 |a Invited Talks -- Dynamic Graph Algorithms with Applications -- Coping with the NP-Hardness of the Graph Bandwidth Problem -- Toward Complete Genome Data Mining in Computational Biology -- Data Structures -- A New Trade-Off for Deterministic Dictionaries -- Improved Upper Bounds for Pairing Heaps -- Maintaining Center and Median in Dynamic Trees -- Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time -- Graph Algorithms -- A Dynamic Algorithm for Maintaining Graph Partitions -- Data Structures for Maintaining Set Partitions -- Graph Algorithms -- Fixed Parameter Algorithms for Planar Dominating Set and Related Problems -- Embeddings of k-Connected Graphs of Pathwidth k -- On Graph Powers for Leaf-Labeled Trees -- Recognizing Weakly Triangulated Graphs by Edge Separability -- Online Algorithms -- Caching for Web Searching -- On-Line Scheduling with Precedence Constraints -- Scheduling Jobs Before Shut-Down --  
505 0 |a Resource Augmentation in Load Balancing -- Fair versus Unrestricted Bin Packing -- Approximation Algorithms -- A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs -- Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems -- Approximation Algorithms for Maximum Linear Arrangement -- Approximation Algorithms for Clustering to Minimize the Sum of Diameters -- Matchings -- Robust Matchings and Maximum Clustering -- The Hospitals/Residents Problem with Ties -- Network Design -- Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph -- On the Minimum Augmentation of an ?-Connected Graph to a k-Connected Graph -- Locating Sources to Meet Flow Demands in Undirected Networks -- Improved Greedy Algorithms for Constructing Sparse Geometric Spanners -- Computational Geometry -- Computing the Penetration Depth ofTwo Convex Polytopes in 3D -- Compact Voronoi Diagrams for Moving Convex Polygons --  
505 0 |a Least Adaptive Optimal Search with Unreliable Tests 
653 |a Computer Communication Networks 
653 |a Artificial intelligence / Data processing 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Computer programming 
653 |a Algorithms 
653 |a Computer networks  
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
653 |a Theory of Computation 
653 |a Data Science 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-44985-X 
856 4 0 |u https://doi.org/10.1007/3-540-44985-X?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.11 

Similar Items