R-Restricted Steiner Problem is NP-Complete
Journal Title: UNKNOWN - Year 2015, Vol 4, Issue 4
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.
Authors and Affiliations
Keywords
Related Articles
- EP ID EP366415
- DOI -
- Views 125
- Downloads 0
Net Asset Value Prediction using FLANN Model
: Financial forecasting which includes the financial data such as interest rate, exchange rate, stock market, mutual fund asset value and bankruptcy is the hottest topic for the researcher due to its importance in financ...
Isolation of LP (a) from Human Serum Lipoproteins and its Sialic Acid Concentration
"Lp(a), a genetic variant of β-lipoproteins (LDL) was isolated from human serum and was characterized to study its behavior and sialic acid concentration. Like LDL, Lp (a) also contains significant amounts of sialic acid...
A Search Algorithm “My-Search” To Find Elements
"THIS IS A ALGORITHM WHICH HAS THE SAME TIME COMPLEXITY AS THAT OF LINEAR SEARCH OF -O(n)-.BUT STILL IT IS BETTER THAN -LINEAR SEARCH- IN TERMS OF EXECUTION TIME. LET A[ ] BE THE ARRAY OF SOME SIZE N. IF THE ELEMENT WHIC...
An Experimental Study on Parametric Optimization of High Carbon Steel (EN-31) by using Silicon Powder Mixed Dielectric EDM Process
Powder mixed electric discharge machining (PMEDM) is a recent innovation for enhancing the capabilities of electrical discharge machining process. The objective of present study is to realize the potential of silicon pow...
Optimal Solution for Degeneracy Fuzzy Transportation Problem Using Zero Termination and Robust Ranking Methods
In this paper, we propose a new method for the Fuzzy optimal solution to the Degeneracy transportation problem with Fuzzy parameters. We develop Fuzzy version of Zero Termination and FMODI algorithms for finding Fuzzy ba...