Sciweavers

7150 search results - page 32 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
COR
2008
131views more  COR 2008»
15 years 1 days ago
Comparing methods for multiattribute decision making with ordinal weights
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...
Byeong Seok Ahn, Kyung Sam Park
108
Voted
SIGIR
2006
ACM
15 years 6 months ago
AggregateRank: bringing order to web sites
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...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
WDAG
2009
Springer
195views Algorithms» more  WDAG 2009»
15 years 7 months ago
A Local 2-Approximation Algorithm for the Vertex Cover Problem
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,...
Matti Åstrand, Patrik Floréen, Valent...
119
Voted
APPROX
2004
Springer
180views Algorithms» more  APPROX 2004»
15 years 5 months ago
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
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...
Markus Bläser