667 search results - page 28 / 134 » Approximation algorithms for connected facility location pro... |
106
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
104
click to vote
STOC
2004
ACM
16 years 20 days ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
MOBIHOC
2003
ACM
15 years 12 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
84
Voted
EOR
2006
15 years 11 days ago
2006
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...
105
Voted
ANOR
2005
15 years 8 days ago
2005
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner...