Sciweavers

108 search results - page 9 / 22
» Two-Level Push-Relabel Algorithm for the Maximum Flow Proble...
Sort
View
DAM
2006
100views more  DAM 2006»
13 years 7 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
JSAC
2010
116views more  JSAC 2010»
13 years 2 months ago
Utility-based asynchronous flow control algorithm for wireless sensor networks
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
Jiming Chen, WeiQiang Xu, Shibo He, Youxian Sun, P...
ICCSA
2007
Springer
14 years 1 months ago
Quasi-hierarchical Evolutionary Algorithm for Flow Optimization in Survivable MPLS Networks
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
Michal Przewozniczek, Krzysztof Walkowiak
SIGMETRICS
2009
ACM
140views Hardware» more  SIGMETRICS 2009»
14 years 2 months ago
Maximum likelihood estimation of the flow size distribution tail index from sampled packet data
In the context of network traffic analysis, we address the problem of estimating the tail index of flow (or more generally of any group) size distribution from the observation of...
Patrick Loiseau, Paulo Gonçalves, Sté...
STOC
1993
ACM
179views Algorithms» more  STOC 1993»
13 years 11 months ago
The network inhibition problem
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...
Cynthia A. Phillips