7150 search results - page 98 / 1430 » An Approximation Algorithm for Approximation Rank |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
145
click to vote
DAM
2000
15 years 2 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
152
click to vote
MOR
2007
15 years 1 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
122
click to vote
ISLPED
2007
ACM
15 years 4 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
128
click to vote
CPM
2000
Springer
15 years 6 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...