Summary: The maximal dense tree problem on a graph with dynamic edge
Dept. of Computer Science
Johns Hopkins University
In this paper we provide a polylogarithmic competitive online algorithm for the maximal dense
tree problem on a graph with dynamic edge weights. The previous work on the topic, [AS97], only
handled static edge weights.
We expect that the inclusion of dynamic edge weights will signicantly improve the utility of
our algorithm. Specically we expect simpler and better solutions to the important throughput
competitive online multicast problem.
1.1 Statement of the Maximal Dense Tree problem and the results
The traditional static edge weight version of the maximal dense tree is formulated as follows. We are given
a directed graph with non-negative edge weights and a specied root node. The input of the problem
are online requests from nodes v 2 V . The output of the algorithm is either rejection, or acceptance, and
in case of acceptance, connection via an undirected path to a previously connected node, or to the root.