We use results from the 2011 MIREX “Audio Music Similarity and Retrieval” task for a meta analysis of the hub phenomenon. Hub songs appear similar to an undesirably high number of other songs due to a problem of measuring distances in high dimensional spaces. Comparing 17 algorithms we are able to confirm that different algorithms produce very different degrees of hubness. We also show that hub...

In this paper we consider a capacitated single allocation p-hub median problem (CSApHMP) which is to determine the location of p hubs, the allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total transportation cost and fixed cost of the selected p hubs. Since the CSApHMP is NP-hard...

In this paper we consider a capacitated single allocation p-hub median problem with multiple capacity levels (CSApHMPMC) in which the decisions are to determine the location of p hubs and their capacity levels, the single allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total tran...

There has been significant success in designing highly efficient algorithms for distance and shortest-path queries in recent years; many of the state-of-the-art algorithms use the hub labeling framework. In this paper, we study the approximability of the Hub Labeling problem. We prove a hardness of Ω(log n) for Hub Labeling, matching known approximation guarantees. The hardness result applies t...

Available online 24 December 2008

A p-hub center network design problem consists of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first time...

We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...