Results 1  10
of
2,633,965
On the 2Stage StochasticWeighted Matching Problem
, 2005
"... We study a 2stage stochastic extension of the classical maximum weighted matching problem on graphs, proposed recently by Kong and Schaefer [2004]. The authors show the NPhardness of the problem and present a constant factor approximation algorithm. This work explores an extension of this approxi ..."
Abstract
 Add to MetaCart
We study a 2stage stochastic extension of the classical maximum weighted matching problem on graphs, proposed recently by Kong and Schaefer [2004]. The authors show the NPhardness of the problem and present a constant factor approximation algorithm. This work explores an extension
Solving Various Weighted Matching Problems with Constraints
, 1997
"... This paper studies the resolution of (augmented) weighted matching problems within a constraint programming framework. The first contribution of the paper is a set of branchandbound techniques that improves substantially the performance of algorithms based on constraint propagation and the second ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
This paper studies the resolution of (augmented) weighted matching problems within a constraint programming framework. The first contribution of the paper is a set of branchandbound techniques that improves substantially the performance of algorithms based on constraint propagation and the second
A Simple Approximation Algorithm for the Weighted Matching Problem
 Information Processing Letters
, 2003
"... We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7]. ..."
Abstract

Cited by 48 (3 self)
 Add to MetaCart
We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7].
A Simple Parallel Approximation Algorithm for the Weighted Matching Problem
"... Abstract. Given a weighted graph, the weighted matching problem is to find a matching with maximum weight. The fastest known exact algorithm runs in O(nm + n 2 log n) however for many real world applications this is too costly, and an appromixate matching is sufficient. A capproximation algorithm i ..."
Abstract
 Add to MetaCart
Abstract. Given a weighted graph, the weighted matching problem is to find a matching with maximum weight. The fastest known exact algorithm runs in O(nm + n 2 log n) however for many real world applications this is too costly, and an appromixate matching is sufficient. A capproximation algorithm
Fast Parallel Approximation Algorithms for Maximum Weighted Matching Problem
"... We present two parallel approximation algorithms for finding a matching of maximum weight in a given edgeweighted graph. To deal with unbounded weights efficiently on a PRAM, the algorithms only use the total order of the weights. That is, we assume that the algorithms can only compare with weights ..."
Abstract
 Add to MetaCart
the algorithm can be performed on a large scale distributed system. Key words: approximation algorithm, maximum weighted matching, parallel algorithm, randomized algorithm. 1 Introduction A matching in a graph is the set of independent edges. The problem to find a matching is a fundamental topic in graph
A Combinatoric Interpretation of Dual Variables for Weighted Matching Problems
, 2012
"... We consider four weighted matchingtype problems: the bipartite graph and general graph versions of matching and ffactors. The linear program duals for these problems are shown to be weights of certain subgraphs. Specifically the socalled y duals are the weights of certain maximum matchings or ff ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider four weighted matchingtype problems: the bipartite graph and general graph versions of matching and ffactors. The linear program duals for these problems are shown to be weights of certain subgraphs. Specifically the socalled y duals are the weights of certain maximum matchings or f
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 823 (67 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 541 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear
Semantic matching of web services capabilities
, 2002
"... Abstract. The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web ..."
Abstract

Cited by 569 (24 self)
 Add to MetaCart
services. In this paper we concentrate on the first problem: the location of web services on the basis of the capabilities that they provide. The solution of this problem requires a language to express the capabilities of services, and the specification of a matching algorithm between service
Results 1  10
of
2,633,965