Sciweavers

186 search results - page 14 / 38
» The Partial Augment-Relabel Algorithm for the Maximum Flow P...
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
INFOCOM
2009
IEEE
14 years 2 months ago
Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
Mhameed Aezladen, Reuven Cohen, Danny Raz
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 ...
JACM
2007
121views more  JACM 2007»
13 years 7 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...