Downloads: 104
Research Paper | Mathematics | India | Volume 4 Issue 4, April 2015
R-Restricted Steiner Problem is NP-Complete
Dr. G. Nirmala [5] | C. Sujatha [2]
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
Similar Articles with Keyword 'minimum'
Downloads: 1 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 11 Issue 12, December 2022
Pages: 794 - 799Fully Fuzzy Solution of Transportation Problem in Fuzzy Environment
Anju Raj [3] | Jitendra Singh [10]
Downloads: 2 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, Congo (DRC), Volume 10 Issue 5, May 2021
Pages: 571 - 577Solvency and Reinsurance Treaty of an Automobile Portfolio: Case of Sub-Saharian Countries
Bukanga Maheshe Crispin | Mabela Makengo Matendo Rostin