Titlebook: Algorithms and Computation; 20th International S Yingfei Dong,Ding-Zhu Du,Oscar Ibarra Conference proceedings 2009 Springer-Verlag Berlin H

長矛

公共汽車

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm,s problem is NP-hard [11] and the best previous practical solution is a 38-approximation algorithm by Carmi et al. [4]. We first consider the line-separable discrete unit disk cover problem (the set of disk centres can be separated from the set of points by a line) for which we present an .(...)-tim

神經(jīng)

Assignment

On Protein Structure Alignment under Distance Constraint, between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective of maximizing either (A) the size of the subsets (LCP

變形

植物茂盛

hurricane

,Fréchet Distance Problems in Weighted Regions,hted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases we give algorithms for finding a (1?+?.)-factor approximation of the Fréchet distance between two polygonal curves. We also cons

尾隨

樂意

Affection

New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body,or any convex body . in the plane, the average distance from the Fermat-Weber center of . to the points of . is larger than ., where Δ(.) is the diameter of .. This proves a conjecture of Carmi, Har-Peled and Katz. From the other direction, we prove that the same average distance is at most .. The n