Sciweavers

290 search results - page 9 / 58
» Balancing Applied to Maximum Network Flow Problems
Sort
View
STACS
1999
Springer
13 years 11 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 1 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
SIROCCO
2007
13 years 8 months ago
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
In a sensor network the sensors, or nodes, obtain data and have to communicate these data to a central node. Because sensors are battery powered they are highly energy constrained....
Peter Korteweg, Alberto Marchetti-Spaccamela, Leen...
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
13 years 11 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
13 years 10 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler