File Transfer Tree Problems

Authors:
Hiro Ito;Hiroshi Nagamochi;Yosuke Sugiyama;Masato Fujita
Affiliations:
-;-;-;-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 7
Cited 0

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Scheduling file transfers for trees and odd cycles

SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Data transfer in networks with transceivers

Networks
The complexity of file transfer scheduling with forwarding

SIAM Journal on Computing
Approximating the minimum degree spanning tree to within one from the optimal degree

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an edge-weighted digraph G with a designated vertex r, and a vertex capacity 驴, we consider the problem of finding a shortest path tree T rooted at r such that for each vertex v the number of children of v in T does not exceed the capacity 驴(v). The problem has an application in designing a routing for transferring files from the source node to other nodes in an information network. In this paper, we first present an efficient algorithm to the problem. We then introduce extensions of the problem by relaxing the degree constraint or the distance constraint in various ways and show polynomial algorithms or the computational hardness of these problems.