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...
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
In one dimensional facility games, public facilities are placed based on the reported locations of the agents, where all the locations of agents and facilities are on a real line. ...
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...