Titlebook: Algorithms and Complexity; 5th Italian Conferen Rossella Petreschi,Giuseppe Persiano,Riccardo Silv Conference proceedings 2003 Springer-Ver

痛打

An Improved Algorithm for Point Set Pattern Matching under Rigid Motionts on random point sets and fingerprint databases show that it needs much less time in actual practice. The algorithm is then extended for checking the existence of a matching among two sets of line segments under rigid motion in .(.log.) time, and locating a query polygon among a set of sample polygons in .(.) time under rigid motion.

猛擊

Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphstions. This introduces upper bounds on the size of a smallest weakly-connected dominating set of a random regular graph. We then show that for random regular graphs, other “growing” greedy strategies have exactly the same average-case performance as the simple heuristic.

Compatriot

Sicherheit – interdisziplin?re Perspektivenions of the art gallery problem. In particular we consider the following problems: given a polygon with or without holes and . available guards, maximize a) the . guarded and b) the . of paintings . or .. We prove that all the above problems are APX-complete.

languor

行業(yè)

SUGAR

Unlocking the Advantages of Dynamic Service Selection and Pricing a surprising win-win situation for BOTH the service providers AND the users. In this paper, we present easy to implement online algorithms to minimize the overall usage cost to individual mobile users.

deciduous

Functional

Misnomer

Additive Spanners for ,-Chordal Graphs· log .) time. Furthermore, our method can be extended to graphs with largest induced cycles of length .. Any such graph admits an additive (. + 1)-spanner with at most 2. ? 2 edges which is constructable in .(. · . + .) time.

廢止

Reconciling Gene Trees to a Species Trees at most two. Finally we introduce two novel formulations for the problem of recombining evolutionary trees, extending the notion of the gene duplication problem studied in [88,11,9,10,6], and we give an exact algorithm (via dynamic programming) for one of the formulations given.