1639 search results - page 38 / 328 » Degree-constrained network flows |
MP
2002
13 years 10 months ago
2002
We study the polyhedra of splittable and unsplittable single arc
ICMLA
2004
14 years 11 days ago
2004
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
DIALM
2008
ACM
14 years 23 days ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
COMCOM
2004
13 years 10 months ago
2004
In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of ...
NETWORKS
2007
13 years 10 months ago
2007
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...