A complete weighted graph G=(V, E, w) is called Δ β-metric, for some β≥ 1/2, if G satisfies
the β-triangle inequality, ie, w (u, v)≤ β⋅(w (u, x)+ w (x, v)) for all vertices u, v, x∈ V. Given a …

Abstract For some β≥ 1/2, a Δ β-metric graph G=(V, E, w) is a complete edge-weighted
graph such that w (v, v)= 0, w (u, v)= w (v, u), and w (u, v)≤ β·(w (u, x)+ w (x, v)) for all …

Abstract Let G=(V, E, w) be a Δ β-metric graph with a distance function w (⋅,⋅) on V such
that w (v, v)= 0, w (u, v)= w (v, u), and w (u, v)≤ β⋅(w (u, x)+ w (x, v)) for all u, v, x∈ V. Given …

The server allocation problem is a facility location problem for a distributed processing
scheme on a real-time network. In this problem, we are given a set of users and a set of …

Given a metric graph G=(V, E, w), a specific vertex c∈ V, and an integer p, let T be a depth-2
spanning tree of G rooted at c such that c is adjacent to p vertices called hubs and each of …

A complete weighted graph G=(V, E, w) is called\varDelta _ β-metric, for some β ≥ 1/2, if G
satisfies the β-triangle inequality, ie, w (u, v) ≤ β ⋅ (w (u, x)+ w (x, v)) for all vertices u, v, x ∈ …

A complete weighted graph G=(V, E, w) is called\varDelta _ β-metric, for some β ≥ 1/2, if G
satisfies the β-triangle inequality, ie, w (u, v) ≤ β ⋅ (w (u, x)+ w (x, v)) for all vertices u, v, x ∈ …

Minimizing transportation costs through the design of a hub-and-spoke network is a crucial
concern in hub location problems (HLP). Within the realm of HLP, the Δ β-Star p-Hub …

Abstract In the Star k-Hub Center (SkHC), given a connected edge-weighted graph G, a
center c ε V (G) and integers k, r> 0, one wants to select a set of hubs H⊆ V (G)\{c} of size k …

Given a metric graph G=(V, E, w) and an integer k, we aim to find a single allocation k-hub
location, which is a spanning subgraph consisting of a clique of size k such that every node …