A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs

Abstract

Steiner Minimal Tree (SMT) is a complex optimization problem that has many important applications in science and technology; This is a NP-hard problem. Much research has been carried out to solve the SMT problem using approximate algorithms. This paper presents A Variable Neighborhood Search (VNS) algorithm for solving the SMT problem in sparse graphs; The proposed algorithm has been tested on sparse graphs in a standardized experimental data system, and it yields better results than some other heuristic algorithms.

Authors and Affiliations

C. V. Tran, N. H. Ha

Keywords

Related Articles

Understanding the Role of Data-Centric Social Context in Personalized Mobile Applications

Context-awareness in personalized mobile applications is a growing area of study. Social context is one of the most important sources of information in human-activity based applications. In this paper, we mainly focus on...

8th EAI International Conference on Context-Aware Systems and Applications (ICCASA 2019) AND 5th EAI International Conference on Nature of Computation and Communication (ICTCC 2019)

The ICCASA and ICTCC 2019 conferences sponsored by EAI, Tien Giang University (TGU) and Nguyen Tat Thanh University (NTTU) are place for highly original ideas about how context-awareness and nature are going to shape net...

Hidden Markov Model for recognition of skeletal databased hand movement gestures

The development of computing technology provides more and more methods for human-computer interaction applications. The gesture or motion of a human hand is considered as one of the most basic communications for interact...

The Approach of Applying Augmented Reality Application with Infographic for Supporting Health Care

There are more and more people can access the technology, digital divide has been reduced over the years. In this paper intend to clarify and demonstrated how Thailand want to apply the trendy and advance technology to p...

An Introduction to the Book Titled “Formal and Practical Aspects of Autonomic Computing and Networking: Specification, Development and Verification”

Dr. Phan Cong Vinh, Nguyen Tat Thanh University in Vietnam, introduces the book titled “Formal and Practical Aspects of Autonomic Computing and Networking: Specification, Development and Verification” edited by hi...

Download PDF file
  • EP ID EP45811
  • DOI http://dx.doi.org/10.4108/eai.6-2-2019.156534
  • Views 285
  • Downloads 0

How To Cite

C. V. Tran, N. H. Ha (2018). A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs. EAI Endorsed Transactions on Context-aware Systems and Applications, 5(15), -. https://europub.co.uk/articles/-A-45811