A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Abstract-Finding a path subject to multiple QoS requirements is regarded as a critical component in wireless mesh networks especially the real-time wireless communication applications become increasingly popular. As far as we know, it is an NPcomplete problem. This paper devises a simple and fast Kapproximation algorithm (KAMCOP) to deal with it from the perspective of approximate. The theoretical validations for the proposed algorithm show that, its approximation ratio is K and the timedoi:10.12720/jcm.11.2.126-131 fatcat:zpgmxvb5n5hsdglo5kwexgezou