This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...