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 127
- Downloads 0
DSP for Smart Bio-Metric Solutions
Biometrics is the science of measuring and statistically analyzing biological data. In information technology, biometrics refers to the use of a person
Effect of Vitamin-D, Zinc and Copper Supplementation in HIV-Positive Pregnant Women and Co-Relation with CD4 Counts- A Double Blinded Placebo Controlled Study
"Abstract: TITLE : Effect of vitamin-D, zinc and copper supplementation in HIV-positive pregnant women and co-relation with CD4 counts- a randomized double blinded placebo controlled study. BACKGROUND: The main aim of th...
Management of Thumb Sucking Habit in a 8 Year Old Child – A Case Report
Oral habits are very common and one of the most deleterious habits which pose a problem to pediatric dentists. Oral appliances, if inserted for several months, usually eliminate the habit, however, emotional problems, di...
Black Hole Attack Detection using Fuzzy Logic
MANET is a dynamic network with large number of mobile nodes .As the traffic increases over the manet it will leads to number of problems i.e congestion and packet loss .This congestion and packet loss problems occurs du...
Genetic Diversity of Chrysoperla sp. at East of Red Sea Using Cytochrome Oxidase Subunit I (COI) Gene
Genus Chrysoperla (Neuroptera: Chrysopidae) contains 36 species. Chrysoperla carnea Stephens is a widespread predator in agroecosystems with great potential in biological pest control. C. carnea contains several cryptic...