220 search results - page 14 / 44 » Primal-Dual Algorithms for Connected Facility Location Probl... |
JCO
1998
14 years 11 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
ANOR
2002
14 years 11 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
113
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
111
click to vote
PPSN
1998
Springer
15 years 3 months ago
1998
Springer
The facility design problem is a common one in manufacturing and service industries and has been studied extensively in the literature. However, restrictions on the scope of the de...