170 search results - page 16 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
ANOR
2004
13 years 7 months ago
2004
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Due to the rapid growth of real-time applications and the ubiquity of IEEE 802.11 MAC as a layer-2 protocol for wireless local area networks (WLANs), it is of increasing interes...