2137 search results - page 314 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
141
Voted
PPSN
1998
Springer
15 years 9 months ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
137
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
139
click to vote
TCS
2011
14 years 12 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
145
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
161
click to vote
VC
2011
14 years 12 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...