25 search results - page 3 / 5 » focs 1996 |
FOCS
1996
IEEE
14 years 1 months ago
1996
IEEE
FOCS
1996
IEEE
14 years 1 months ago
1996
IEEE
FOCS
1996
IEEE
14 years 1 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
FOCS
1996
IEEE
14 years 1 months ago
1996
IEEE
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
FOCS
1996
IEEE
14 years 1 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...