Downloads: 104 | Views: 416
Research Paper | Mathematics | India | Volume 4 Issue 4, April 2015 | Popularity: 6.1 / 10
R-Restricted Steiner Problem is NP-Complete
Dr. G. Nirmala, C. Sujatha
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
Edition: Volume 4 Issue 4, April 2015
Pages: 2164 - 2166
Please Disable the Pop-Up Blocker of Web Browser
Verification Code will appear in 2 Seconds ... Wait
Dr. G. Nirmala, C. Sujatha, "R-Restricted Steiner Problem is NP-Complete", International Journal of Science and Research (IJSR), Volume 4 Issue 4, April 2015, pp. 2164-2166, https://www.ijsr.net/getabstract.php?paperid=SUB153555, DOI: https://www.doi.org/10.21275/SUB153555