Kaiserslautern - Fachbereich Informatik
Refine
Year of publication
- 2007 (1)
Document Type
- Report (1)
Language
- English (1)
Has Fulltext
- yes (1)
Keywords
- NP-hard (1) (remove)
Faculty / Organisational entity
On the Complexity of the Uncapacitated Single Allocation p-Hub Median Problem with Equal Weights
(2007)
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.