We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 âˆ’ ). This improves the previously best approximation ratio of ( 1 2 âˆ’ ) of an NCâ€¦ (More)

The terminal Steiner tree problem is a special version of the Steiner tree problem, where a Steiner minimum tree has to be found in which all terminals are leaves. We prove that no polynomial timeâ€¦ (More)

Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm forâ€¦ (More)

The weighted matching problem is to find a matching in a weighted graph that has maximum weight. The fastest known algorithm for this problem has running time O(nm + n log n). Many real worldâ€¦ (More)