Titlebook: Experimental Algorithms; 6th International Wo Camil Demetrescu Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Simulatio

不可救藥

Random Models for Geometric Graphs (Abstract)pattern in wireless ad-hoc networks. The different communication ways or protocol implementations have directed the interest of the commnity to study and use different intersection graph families as basic models of communication. In this talk we review those models when the graph nodes are placed at

ANTI

Better Landmarks Within Reachdmark-based lower bounds, and reach-based pruning. Through reach-aware landmarks, better use of cache, and improved algorithms for reach computation, we make preprocessing and queries faster while reducing the overall space requirements. On the road networks of the USA or Europe, the shortest path b

amplitude

Landmark-Based Routing in Dynamic Graphscessed information, which has to be updated whenever the graph is changed. However, goal directed search based on landmarks (.) still performs correct queries as long as an edge weight does not drop below its initial value. In this work, we evaluate the robustness of . with respect to traffic jams.

和平主義者

Dynamic Highway-Node Routingrios that arise in present-day navigation systems: When an edge weight changes (e.g., due to a traffic jam), we can update the preprocessed information in 2–40 ms allowing subsequent fast queries in about one millisecond on average. When we want to perform only a single query, we can skip the compar

Guileless

HEW

新星

Cache-, Hash- and Space-Efficient Bloom Filtersw variants of Bloom filters and replacements with similar functionality. All of them have a better cache-efficiency and need less hash bits than regular Bloom filters. Some use SIMD functionality, while the others provide an even better space efficiency. As a consequence, we get a more flexible trad

使人入神

Crossing Minimization in Weighted Bipartite Graphse number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edg

hardheaded

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSPexponential-sized space of TSP tours, each of which is a 2-approximation to the exact solution. We consider the problem of ., for which Burkard et al. gave an algorithm running in time .(2...) and memory .(2...), where . is the maximum node degree in the rooted minimum spanning tree (e.g. in the non

UTTER