599 search results - page 21 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
132
Voted
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
101
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
107
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
205
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
84
Voted
STOC
1998
ACM
15 years 3 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...