874 search results - page 5 / 175 » Faster Algorithms for Semi-Matching Problems |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
ALGOSENSORS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
ESA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...