121 search results - page 18 / 25 » Approximating Maximum Weight Matching in Near-Linear Time |
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
TSP
2008
13 years 10 months ago
2008
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
ICIP
2007
IEEE
15 years 18 days ago
2007
IEEE
The Bayesian filtering for recursive state estimation and the shape-based matching methods are two of the most commonly used approaches for target tracking. The Multiple Hypothesi...
ACID
2006
14 years 10 days ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...