Approximation algorithms for the shortest total path length spanning tree problem
Discrete Applied Mathematics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Distributed approximation: a survey
ACM SIGACT News
| Hi-index | 0.00 |
This paper presents a distributed algorithm to allocate resources (links of a network) for interconnecting machines (forming a group) spread in a network. This is what we call a connection structure for this group of machines. An important innovative feature of our construction method is that we prove (not just simulate on particular and restricted cases) the fact that this structure has good properties in terms of, simultaneously, induced distances (for latency considerations) and cost (for cost considerations). Hence, we propose a distributed multicriteria approximation algorithm.