The 5-Star-Hub-Problem is NP-complete

Hochstättler, Winfried and Oertel, Peter (2000) The 5-Star-Hub-Problem is NP-complete.
Technical Report , 4 p.

Abstract

In this report we present a partial solution of the problems we left open in 99-384. We show that the 5-Star-Hub-Problem is NP-complete.


Actions:
Download: [img] Postscript
Download (114Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik2000-385
Depositing User: Winfried Hochstättler
Date Deposited: 02 Apr 2001 00:00
Last Modified: 16 Jan 2012 13:49
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/385