1161 search results - page 52 / 233 » Approximation schemes for clustering problems |
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
104
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
CSC
2009
14 years 10 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
FGCS
2006
14 years 9 months ago
2006
This paper deals with the solvability of contact problems with a local visco-plastic friction in the thermo-visco-plastic Bingham rheology. The generalized case of bodies of arbit...
100
click to vote
AIR
2006
14 years 9 months ago
2006
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...