7129 search results - page 89 / 1426 » Approximation Algorithms for Treewidth |
144
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
162
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
ICPR
2000
IEEE
15 years 7 months ago
2000
IEEE
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
142
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
107
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...