Sciweavers

Share
54 search results - page 1 / 11
» Flow trees for vertex-capacitated networks
Sort
View
WSS
1997
112views Control Systems» more  WSS 1997»
9 years 7 months ago
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
Jorge Arturo Cobb, Mohamed Waris
IPCO
1996
118views Optimization» more  IPCO 1996»
9 years 7 months ago
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
Sándor P. Fekete, Samir Khuller, Monika Kle...
DAM
2007
78views more  DAM 2007»
9 years 5 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
NETWORKS
2010
9 years 4 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
ICALP
2003
Springer
9 years 11 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
books