Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
A faster computation of the most vital edge of a shortest path
Information Processing Letters
Oracles for distances avoiding a link-failure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Internetworking Technologies Handbook, Third Edition
Internetworking Technologies Handbook, Third Edition
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract
Eighteenth national conference on Artificial intelligence
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Fast payment schemes for truthful mechanisms with verification
Theoretical Computer Science
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science
Approximate mechanisms for the graphical TSP and other graph traversal problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Strongly polynomial-time truthful mechanisms in one shot
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Designing a truthful mechanism for a spanning arborescence bicriteria problem
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
Let a communication network be modelled by a graph G=(V,E) of n nodes and m edges. Classic communication operations among nodes in the graph (e.g., broadcasting, multicasting, gossiping, etc.) usually take place on a subgraph of G, which is built in such a way that a given objective function is optimized. Among the many possible topologies of such a subgraph, the minimum radius spanning tree (MRST) is a rooted tree which minimizes the distance from the root to a farthest node. The MRST finds a natural application in several facility location problems, since it allows to minimize the maximum delay for reaching the center from the periphery of the tree. In this paper, we consider the problem of computing an MRST in a non-cooperative setting in which each edge of G is controlled by a selfish agent, and the cost she asks for using her edge depends only on her private information. Under these assumptions, we provide a mechanism that computes a true MRST of G in O(mn√n+n3 log n) time and O(n2 √n) space. Interestingly, this is just at most a linear factor away from the time needed to compute an MRST in a canonical centralized framework.