The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let G=(V,E) denote a weighted graph of n nodes and m edges, and let G[ V ′ ] denote the subgraph of G induced by a subset of nodes V′ ⊆ V. The radius of G[ V ′ ] is the maximum length of a shortest path in G[ V ′ ] emanating from its center (i.e., a node of G[ V ′ ] of minimum eccentricity). In this paper, we focus on the problem of partitioning the nodes of G into exactly p non-empty subsets, so...
Let G = (V,E) denote an undirected weighted graph of n nodes and m edges, and let U ⊆ V. The relative eccentricity of a node v ∈ U is the maximum distance in G between v and any other node of U, while the radius of U in G is the minimum relative eccentricity of all the nodes in U. Several facility location problems ask for partitioning the nodes of G so as to minimize some global optimization function...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.