[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Coping with the NP-Hardness of the Graph Bandwidth Problem

✍ Scribed by Feige, Uriel

• Book ID: 120155364
• Publisher: Springer Berlin Heidelberg
• Year: 2000
• Tongue: German
• Weight: 107 KB
• Category: Article
• ISBN: 354044985X
• DOI: 10.1007/3-540-44985-X_2

✦ Synopsis

This book constitutes the refereed proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, held in Bergen, Norway, in July 2000.The 43 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from a total of 105 submissions. The papers are organized in sections on data structures, dynamic partitions, graph algorithms, online algorithms, approximation algorithms, matchings, network design, computational geometry, strings and algorithm engineering, external memory algorithms, optimization, and distributed and fault-tolerant computing.