The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.The minimum dominating set problem on the visibility graph (known as the art gallery problem) is known to be NP-hard [O87]. Though the efforts have been made by many researchers to design algorithms for problems on the visibility graph, anbsp;...
|Author||:||Rolf Karlsson, Andrzej Lingas|
|Publisher||:||Springer Science & Business Media - 1988-06-22|