Experimental Algorithms: 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, ProceedingsCamil Demetrescu Springer, 27 thg 6, 2007 - 450 trang This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007. The 30 revised full papers presented together with three invited talks cover the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. |
Nội dung
| 1 | |
Engineering Fast Route Planning Algorithms | 23 |
Random Models for Geometric Graphs | 37 |
Better Landmarks Within Reach | 38 |
LandmarkBased Routing in Dynamic Graphs | 52 |
Dynamic HighwayNode Routing | 66 |
Dynamic Trees in Practice | 80 |
On the Cost of Persistence and Authentication in Skip Lists | 94 |
Engineering Algorithms for Approximate Weighted Matching | 242 |
Experimental Evaluation of Parametric MaxFlow Algorithms | 256 |
A Running Time Comparison | 270 |
Vertex Cover Approximations on Random Graphs | 285 |
Optimal Edge Deletions for Signed Graph Balancing | 297 |
Algorithms for the Balanced Edge Partitioning Problem | 311 |
Experimental Evaluations of Algorithms for IP Table Minimization | 324 |
Algorithms for Longer OLED Lifetime | 338 |
Cache Hash and SpaceEfficient Bloom Filters | 108 |
Crossing Minimization in Weighted Bipartite Graphs | 122 |
Fast MinimumWeight DoubleTree Shortcutting for Metric TSP | 136 |
A Robust BranchCutandPrice Algorithm for the Heterogeneous Fleet Vehicle Routing Problem | 150 |
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks | 161 |
A Distributed PrimalDual Heuristic for Steiner Problems in Networks | 175 |
An Experimental Study of Stability in Heterogeneous Networks | 189 |
Simple Compression Code Supporting Random Access and Fast String Matching | 203 |
Engineering a Compressed Suffix Tree Implementation | 217 |
Simple SpaceTime TradeOffs for AESA | 229 |
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data | 352 |
Benchmarks for Strictly Fundamental Cycle Bases | 365 |
A Primal BranchandCut Algorithm for the DegreeConstrained Minimum Spanning Tree Problem | 379 |
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights | 393 |
An Efficient Implementation for the 01 Multiobjective Knapsack Problem | 406 |
Trunk Packing Revisited | 420 |
Exact Algorithms for the Matrix Bid Auction | 433 |
| 446 | |
Ấn bản in khác - Xem tất cả
Experimental Algorithms: 6th International Workshop, WEA 2007, Rome, Italy ... Camil Demetrescu Không có bản xem trước - 2007 |
Thuật ngữ và cụm từ thông dụng
additional algorithm applications approach approximation arcs assume authenticated average balancing better bits bound called changes complexity compression computation consider construction contains corresponding cost cover cuts cycle data structure defined described directed distance distributed dynamic edge efficient example experimental experiments Figure flow function given gives graph grid Heidelberg heuristics implementation improved included increase insertions instances labels length linear LNCS lower bound matching maximum method minimization node Note objects obtained operations optimal original partition performance points position possible preprocessing presented problem protocols query random ratio reach reduction respect road round routing running separation sequence shortest path solution solved space spanning step suffix Table techniques tree update values variant vector vertex vertices weight