Downloads: 104 | Views: 282

Research Paper | Mathematics | India | Volume 4 Issue 4, April 2015 | Popularity: 6.1 / 10

Rate This Article!      

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

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article