Sciweavers

1639 search results - page 2 / 328
» Degree-constrained network flows
Sort
View
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
14 years 15 days ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
13 years 4 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella
TIM
2011
183views more  TIM 2011»
13 years 1 months ago
Calibration and Field Deployment of Low-Cost Fluid Flow-Rate Sensors Using a Wireless Network
—Low-cost networked fluid flow velocity sensors are needed for high-density sampling in environmental research and other applications requiring automated fluid flow velocity mapp...
C. K. Harnett, M. T. Schueler, N. R. Blumenthal, K...
NA
2010
87views more  NA 2010»
13 years 1 months ago
An implicit box scheme for subsonic compressible flow with dissipative source term
We investigate the stability and convergence of an implicit box scheme for subsonic flows modelled by scalar conservation laws with dissipative and possibly stiff source terms. The...
Oliver Kolb, Jens Lang, Pia Bales
HOTNETS
2010
13 years 1 months ago
DevoFlow: cost-effective flow management for high performance enterprise networks
The OpenFlow framework enables flow-level control over Ethernet switching, as well as centralized visibility of the flows in the network. OpenFlow's coupling of these feature...
Jeffrey C. Mogul, Jean Tourrilhes, Praveen Yalagan...