1639 search results - page 75 / 328 » Degree-constrained network flows |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
100
click to vote
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
113
click to vote
SAINT
2008
IEEE
15 years 4 months ago
2008
IEEE
Remote sensing applications are increasingly making use of sensors that generate demanding data flows (e.g. digital imaging devices). This paper presents the
VIZSEC
2007
Springer
15 years 4 months ago
2007
Springer
This paper describes Isis, a system that uses progressive multiples of timelines and event plots to support the iterative investigation of intrusions by experienced analysts using ...
RSA
2010
14 years 8 months ago
2010
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...