369 search results - page 36 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
105
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
DEBU
2010
14 years 12 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
103
click to vote
KDD
2009
ACM
16 years 10 days ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
107
click to vote
IJSNET
2007
14 years 11 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...