500 search results - page 60 / 100 » Approximation algorithms for maximum independent set of pseu... |
218
Voted
WASA
2010
Springer
15 years 7 days ago
2010
Springer
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
102
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
101
Voted
NIPS
2007
15 years 3 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
122
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
122
click to vote
ANOR
2005
15 years 1 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...