R-Restricted Steiner Problem is NP-Complete
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064


Amazon Sale


Research Paper | Mathematics | India | Volume 4 Issue 4, April 2015

R-Restricted Steiner Problem is NP-Complete

Dr. G. Nirmala, C. Sujatha

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

Share this Article

How to Cite this Article?

Dr. G. Nirmala, C. Sujatha, "R-Restricted Steiner Problem is NP-Complete", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=SUB153555, Volume 4 Issue 4, April 2015, 2164 - 2166

42 PDF Views | 42 PDF Downloads

Download Article PDF


Amazon Sale


Similar Articles with Keyword 'NP-complete'

Research Paper, Mathematics, India, Volume 4 Issue 4, April 2015

Pages: 2164 - 2166

R-Restricted Steiner Problem is NP-Complete

Dr. G. Nirmala, C. Sujatha

Share this Article

Research Paper, Mathematics, India, Volume 3 Issue 5, May 2014

Pages: 1473 - 1480

Weight Constrained Travelling Salesman Problem on Halin Graphs

Dharmananda Gahir

Share this Article

Research Paper, Mathematics, India, Volume 3 Issue 6, June 2014

Pages: 315 - 317

A Fully Polynomial Time Approximation Scheme for Weight Constrained BTSP with Two Linear Constraints on Halin Graphs

Dharamananada Gahir

Share this Article
Top