Title of article
Preserving approximation in the Min—Weighted Set Cover Problem
Author/Authors
Giorgio Gambosi، نويسنده , , Marco Protasi، نويسنده , , Maurizio Talamo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
10
From page
13
To page
22
Abstract
In this paper we prove that the approximate solutions to the Min-Weighted Set Cover Problem provided by Chvatalʹs algorithm are combinatorially k-stable with respect to element insertions.
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884483
Link To Document