You are here: DASMOD > PublicationDetail


Start of topic | Skip to actions

On the Complexity of the Uncapacitated Single Allocation p-Hub Median Problem with Equal Weights

Technical Report, Number 363/07, University of Kaiserslautern, 2007

Authors

  • Steffen Wolf

Abstract

The Super-Peer Selection Problem is an optimization problem in network topology construction. It may be cast as a special case of a Hub Location Problem, more exactly an Uncapacitated Single Allocation p-Hub Median Problem with equal weights. We show that this problem is still NP-hard by reduction from Max Clique.

Full Text

BibTeX

 
@TechReport{ Wolf2007SPSP-NP,
title = { On the Complexity of the Uncapacitated Single Allocation p-Hub Median Problem with Equal Weights },
author = { Steffen Wolf },
number = { 363/07 },
institution = { University of Kaiserslautern },
year = 2007,
}


This publication belongs to the project DeNDeMA.

r16 - 11 Jul 2007 - TheoHaerder

Copyright © University of Kaiserslautern, 2009. All material on this website is the property of the respective authors.
Questions or comments? Contact DASMOD webmaster.