Titlebook: Algorithms and Data Structures; 12th International S Frank Dehne,John Iacono,J?rg-Rüdiger Sack Conference proceedings 2011 Springer-Verlag

平淡而無(wú)味

藕床生厭倦

Adjacency-Preserving Spatial Treemaps,ce in rectangular cartograms in which the rectangles represent geographic or political regions. A . is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a

確定方向

cacophony

令人作嘔

蚊帳

大暴雨

albuminuria

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance,adius 1, can be replaced by a strongly connected communication graph, in which each transceiver in . is equipped with a directional antenna of angle . and radius ., for some constant .. Moreover, the new communication graph is a .-spanner of the original graph, for some constant .?=?.(.), with respect to number of hops.

植物茂盛

Multicut in Trees Viewed through the Eyes of Vertex Cover,s us to significantly improve the .(..) upper bound on the kernel size for ., given by Bousquet et al., to .(..). We exploit this connection further to present a parameterized algorithm for . that runs in time ..(..), where .. This improves the previous (time) upper bound of ..(2.), given by Guo and Niedermeier, for the problem.

incarcerate

https://doi.org/10.1007/978-3-642-22300-6DNA synthesis; approximation algorithms; knapsack problem; randomized algorithm; wireless networks; algor