Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G=( V, E) with nonnegative edge cost c e for each edge e∈ E, a set of clients D⊆ V such that each client j∈ D has positive demand d j and a set of facilities F⊆ V each has nonnegative opening cost f i and capacity to serve...
|Published in:||Journal of Combinatorial Optimization, Vol. 16, No. 2 (2008), p. 155-172|
|Other Involved Persons:||;|
|QR Code:||Show QR Code|