We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
Abstract. We propose a new clustering algorithm satisfying requirements for the post-clustering algorithms as many as possible. The proposed “Fuzzy Concept ART” is the form of ...
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...