Efficient distributed algorithm for the location design and routing problem
US9596125B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 3, 2014 |
| Grant date | Mar 14, 2017 |
| Priority date | — |
| Expiry date | Apr 3, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/44
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The Location Design and Routing problem asks to find a subset of “depot” nodes and a spanning forest of a graph such that every connected component in the forest contains at least one depot. This problem arises in a number of both logistical and computer networking problems, for example, in selecting the number and location of distribution centers in vehicle routing networks. This problem is functionally equivalent to that of supernode selection in peer-to-peer networks. A distributed algorithm approximates a solution to this problem that runs in a logarithmic number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, whose solutions are within a factor of 2 of optimal.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.