667 search results - page 21 / 134 » Approximation algorithms for connected facility location pro... |
76
Voted
MOR
2010
14 years 8 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
80
Voted
TCS
2010
14 years 8 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
80
Voted
MICS
2010
14 years 8 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
82
Voted
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
95
Voted
ALGORITHMICA
2011
14 years 1 months ago
2011
