Sciweavers

105 search results - page 11 / 21
» A lock-free multi-threaded algorithm for the maximum flow pr...
Sort
View
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
IPL
2006
97views more  IPL 2006»
13 years 7 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
TON
2008
135views more  TON 2008»
13 years 7 months ago
Measurement-based admission control at edge routers
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
Seung Yeob Nam, Sunggon Kim, Dan Keun Sung
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
13 years 11 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
TSP
2010
13 years 2 months ago
Distributed detection of multi-hop information flows with fusion capacity constraints
The problem of detecting multi-hop information flows subject to communication constraints is considered. In a distributed detection scheme, eavesdroppers are deployed near nodes in...
Ameya Agaskar, Ting He, Lang Tong