500 search results - page 32 / 100 » Approximation algorithms for maximum independent set of pseu... |
122
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
146
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
127
click to vote
WG
2007
Springer
15 years 7 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
148
click to vote
IPCO
2008
15 years 3 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...