Sentence examples for connected facilities from inspiring English sources

These connected facilities are in Elkins, West Virginia.

We consider generalizations of the connected facility location problem, where clients connect to open facilities via access trees that are shared by multiple clients.

We also provide a primal-dual cost sharing method for the connected facility location game with opening costs.

For example, we reduce the approximation ratio for the connected facility location problem from 8.55 to 4.00 and for the single-sink rent-or-buy problem from 3.55 to 2.92.

Similar to the connected facility location problem, the passive optical network design problem requires the search for a subset of deployed distribution points (splitters) as well as an allocation of demand points (optical network units) to minimise deployment cost.

We present cost sharing methods for connected facility location games that are cross-monotonic and competitive and that recover a constant fraction of the cost of the constructed solution.

We introduce a new variant of the connected facility location problem that allows for modeling mixed deployment strategies (FTTC/FTTB/FTTH) in the design of local access telecommunication networks.

Quick summary: We give dirt-simple and easy-to-analyze randomized algorithms that improve the best-known approximation ratios for connected facility location, virtual private network design, and single-sink buy-at-bulk network design.

The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree.

In the connected facility location problem with buy-at-bulk edge costs we are given a set of clients with positive demands and a set of potential facilities with opening costs in an undirected graph with edge lengths obeying the triangle inequality.

The optimization problem is then formulated as an integer linear program, and the problem is the same as a special case of the connected facility location problem, which is known to be NP-hard.