874 search results - page 2 / 175 » Faster Algorithms for Semi-Matching Problems |
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
ISAAC
1993
Springer
15 years 5 months ago
1993
Springer
108
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
112
click to vote
IPL
2008
15 years 1 months ago
2008
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
137
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...