| TR#: | CS0802 |
| Class: | CS |
| Title: | A CONSTANT-FACTOR POLYNOMIAL APPROXIMATION
ALGORITHM FOR THE WEIGHTED VERTEX FEEDBACK SET PROBLEM. |
| Authors: | (782) A. Becker and D. Geiger |
| Not Available | |
| Abstract: |
A vertex feedback set of an undirected graph is a subset of vertices that intersects with the vertex set of each cycle in the graph. Given an undirected graph G with n vertices and weights on its vertices, a polynomial-time algorithm is provided for approximating the problem of finding a vertex feedback set of G with a smallest weight. The performance ratio attained by this algorithm is bounded by 4. The best previously known performance ratio achieved for this problem is \Min \{2 \Delta^2, 4 \Log_2 N\} where \Delta denotes the maximum degree in G and n is the number of vertices.
|
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1994/CS/CS0802), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1994
To the main CS technical reports page