290 search results - page 11 / 58 » Balancing Applied to Maximum Network Flow Problems |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
JACM
2007
13 years 7 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstin...
FITRAMEN
2008
13 years 9 months ago
2008
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
ICWE
2005
Springer
14 years 27 days ago
2005
Springer
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...