4894 search results - page 503 / 979 » The Guarding Problem - Complexity and Approximation |
148
click to vote
VTC
2006
IEEE
15 years 11 months ago
2006
IEEE
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
108
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
134
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
161
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
146
Voted
SIBGRAPI
2005
IEEE
15 years 10 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...