Titlebook: Algorithm Theory - SWAT‘98; 6th Scandinavian Wor Stefan Arnborg,Lars Ivansson Conference proceedings 1998 Springer-Verlag Berlin Heidelberg

温顺

Defizite marxistischer Politik-Theorieh robot visits at most . ≤ . targets in any order. We also prove a lower bound that shows that our protocol is optimal. Prior to this paper, no optimal protocols were known for . > 1. For .=1 optimal protocols were known only for ., while for . only a randomized suboptimal protocol was known.

Leaven

Facility location with dynamic distance functions,as a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results for the .-center problem under this model. This is the first comprehensive study regarding approximation algorithms for facility location for good time-invariant solutions.

Digitalis

爵士乐

Two-variable linear programming in parallel,s use of new geometric observations which can be viewed as generalizations of those used by Megiddo and Dyer‘s sequential algorithms. Our parallel prune-and-search technique also leads to efficient EREW PRAM algorithms for other problems, and is likely to be useful in solving more problems.

enfeeble

Duodenitis

An optimal algorithm for computing visible nearest foreign neighbors among colored line segments, is not intersected by an open line segment in . We present the first optimal θ(. log .) algorithm that computes for each line segment . all its visible nearest foreign neighbors. The algorithm finds applications in polygon arrangement analysis, VLSI design rule checking and GIS.

euphoria

Simple confluently persistent catenable lists,h as catenation, that combine two or more versions. In this paper we develop a simple implementation of persistent double-ended queues with catenation that supports all deque operations in constant amortized time.

persistence

Concurrent multicast in weighted networks, case in which each message must consist of exactly one block of data. We show that the problem of determining the minimum cost to perform concurrent multicast is NP-hard under both assumptions. We also give approximation algorithms to efficiently perform concurrent multicast in arbitrary networks.

Indict

0302-9743 istributed systems, graph theory, approximation, computational biology, queueing, Voronoi diagrams, and combinatorics in general.978-3-540-64682-2978-3-540-69106-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

地壳