Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings
复制标题
算法 - ESA 2008，第 16 届欧洲年度研讨会，德国卡尔斯鲁厄，2008 年 9 月 15-17 日。会议记录
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
C. Maggi
中科院分区：
文献类型：
--
作者：
A. Lecci;S. Giuliani;M. Tramontana;S. Meini;P. Santicioli;C. Maggi
特邀讲座。-使用走廊地图的灵活路径规划。-多核计算的桥梁模型。-贡献论文。-3D中稳健的动态凸壳。-3D中的优势报告。-用线段或多边形刺入凸面多边形。-具有离群值的2D欧几里德2-中心的高效算法。-有界不对称图形中在线Steiner树问题的近乎紧凑的边界。-缓存忽略红蓝线段交点。-现实地形上平分线和Voronoi图的复杂性。-在加倍空间中进行邻近搜索的时空权衡。最大节点容量多流问题的算法。-强连通循环水平图的线性时间平面性测试和嵌入。-三维多面体的直骨架。-两服务器问题的随机竞争分析。-非凸胖多面体的分解和边界覆盖。-近似多准则MAX-TSP。-IP网络中路由优化的整数规划算法。-多处理器实时调度的恒定近似可行性测试。-有向最大叶生成树的紧界和快速FPT算法。-工程树标记方案：最小公共祖先的案例研究。-用于图形处理器的实用快速排序算法。-Bloomier Filters：再看。-耦合路径规划，区域优化，以及在调强放射治疗中的应用。-精确交叉最小化的新方法。-两人调度机制的特征。-局部搜索2-2-相关聚类的近似。-图的Alcuin数。-时间相关的SHARC-路由。-检测定期访问模式。-改进的中继放置的近似算法。-自私装箱。-改进了该间隔选择问题的随机化结果。-任意图形的简洁表示。-加权图形的边缘着色和分解。-使用堆栈和队列网络进行排序的复杂性。-更快的Steiner多项式空间中的树计算。-将阶跃函数拟合到点集。-在最小直径的生成树中进行更快的交换边计算。-用于最大流量问题的部分扩充-重新标记算法。-用于加倍度量空间的最优动态Spanner。-RFQ：赎回公平队列。-范围中等。-二维空间填充曲线的局部性和包围盒质量。-通过随机比较在线箱着色算法的概率分析。-关于最优连接分配的复杂性。-不经意间的随机直接搜索实参数优化。-改进的增量无根树中的路径迷你。-改进CIOQ交换机的竞争性能界限。-指数情形下的两阶段稳健网络设计。-最优递增算法，最大限度地减少延迟和拒绝。-更稳健的散列：带隐藏的布谷鸟散列。-更好和更简单的近似算法，用于稳定的婚姻问题。-编辑偶数排列的距离和因子分解。-基于活动作业计数的流时间调度的快速缩放函数。-动态几何数据流中的设施位置。-对抗性排队模型中局部随机性的影响。-并行成像问题。-寻找最长先前因素的在线算法。-具有验证的抗合谋机制最优解决方案。-用于量子电路模拟的改进的BDD算法。-移动路线规划。-实际的点在多边形策略有多可靠？-处理时间可控的抢占式调度问题的快速分而治之算法-多面体优化方法。-在无关机器上平均完成时间调度的近似性。-半动态细分中的相对凸壳。-Robinson-Foulds距离矩阵算法的实验分析。-关于3D可见性骨架的大小：实验结果。-固定维度CoReset的几乎空间最优的流传输算法。-网络设计的确定性采样算法。
Invited Lectures.- Flexible Path Planning Using Corridor Maps.- A Bridging Model for Multi-core Computing.- Contributed Papers.- Robust Kinetic Convex Hulls in 3D.- On Dominance Reporting in 3D.- Stabbing Convex Polygons with a Segment or a Polygon.- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers.- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.- Cache-Oblivious Red-Blue Line Segment Intersection.- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs.- Straight Skeletons of Three-Dimensional Polyhedra.- Randomized Competitive Analysis for Two-Server Problems.- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra.- Approximating Multi-criteria Max-TSP.- An Integer Programming Algorithm for Routing Optimization in IP Networks.- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.- A Practical Quicksort Algorithm for Graphics Processors.- Bloomier Filters: A Second Look.- Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy.- A New Approach to Exact Crossing Minimization.- A Characterization of 2-Player Mechanisms for Scheduling.- A Local-Search 2-Approximation for 2-Correlation-Clustering.- The Alcuin Number of a Graph.- Time-Dependent SHARC-Routing.- Detecting Regular Visit Patterns.- Improved Approximation Algorithms for Relay Placement.- Selfish Bin Packing.- Improved Randomized Results for That Interval Selection Problem.- Succinct Representations of Arbitrary Graphs.- Edge Coloring and Decompositions of Weighted Graphs.- The Complexity of Sorting with Networks of Stacks and Queues.- Faster Steiner Tree Computation in Polynomial-Space.- Fitting a Step Function to a Point Set.- Faster Swap Edge Computation in Minimum Diameter Spanning Trees.- The Partial Augment-Relabel Algorithm for the Maximum Flow Problem.- An Optimal Dynamic Spanner for Doubling Metric Spaces.- RFQ: Redemptive Fair Queuing.- Range Medians.- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves.- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison.- On the Complexity of Optimal Hotlink Assignment.- Oblivious Randomized Direct Search for Real-Parameter Optimization.- Path Minima in Incremental Unrooted Trees.- Improved Competitive Performance Bounds for CIOQ Switches.- Two-Stage Robust Network Design with Exponential Scenarios.- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.- More Robust Hashing: Cuckoo Hashing with a Stash.- Better and Simpler Approximation Algorithms for the Stable Marriage Problem.- Edit Distances and Factorisations of Even Permutations.- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.- Facility Location in Dynamic Geometric Data Streams.- The Effects of Local Randomness in the Adversarial Queueing Model.- Parallel Imaging Problem.- An Online Algorithm for Finding the Longest Previous Factors.- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.- Improved BDD Algorithms for the Simulation of Quantum Circuits.- Mobile Route Planning.- How Reliable Are Practical Point-in-Polygon Strategies?.- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.- Approximability of Average Completion Time Scheduling on Unrelated Machines.- Relative Convex Hulls in Semi-dynamic Subdivisions.- An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms.- On the Size of the 3D Visibility Skeleton: Experimental Results.- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions.- Deterministic Sampling Algorithms for Network Design.