A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fast payment schemes for truthful mechanisms with verification
Theoretical Computer Science
Kinetic maintenance of mobile k-centres on trees
Discrete Applied Mathematics
Kinetic maintenance of mobile k-centres on trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper presents a new algorithm for finding an absolute center (minimax criterion) of an undirected network with n nodes and m arcs based on the concept of minimum-diameter trees. Local centers and their associated radii are identified by a monotonically increasing sequence of lower bounds on the radii. Computational efficiency is addressed in terms of worst-case complexity and practical performance. The complexity of the algorithm is 0(n2 ℓg n + mn). In practice, because of its very rapid convergence, the algorithm renders the problem amenable even to manual solution for quite large networks, provided that the minimal-distance matrix is given. Otherwise, evaluation of this matrix is the effective computational bottleneck. An interesting feature of the algorithm and its theoretical foundations is that it synthesizes and generalizes some well-known results in this area, particularly Halpern's lower bound on the local radius of a network and properties of centers of tree networks. © 2004 Wiley Periodicals, Inc.