Downloads: 104
India | Mathematics | Volume 4 Issue 4, April 2015 | Pages: 2164 - 2166
R-Restricted Steiner Problem is NP-Complete
Abstract: This work aims to arrive a Steiner minimum tree with -terminals. Every full component of a Steiner tree contains almost 4 terminals. In this work, we propose to flash R-restricted Steiner problem which is NP-complete.
Keywords: Steiner minimum tree, NP-complete, R-restricted Steiner tree, satisfiability
Rating submitted successfully!
Received Comments
No approved comments available.