2137 search results - page 46 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
113
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
117
click to vote
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
110
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
142
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
123
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...