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

How to Cite?: Dr. G. Nirmala, C. Sujatha, "R-Restricted Steiner Problem is NP-Complete", Volume 4 Issue 4, April 2015, International Journal of Science and Research (IJSR), Pages: 2164-2166, https://www.ijsr.net/getabstract.php?paperid=SUB153555, DOI: https://dx.doi.org/10.21275/SUB153555