Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

0.00 Avg rating—0 Votes

Article ID:	iaor2007883
Country:	Netherlands
Volume:	171
Issue:	2
Start Page Number:	648
End Page Number:	660
Publication Date:	Jun 2006
Journal:	European Journal of Operational Research
Authors:	Il'ev Victor, Linker Nick
Keywords:	heuristics

Abstract:

We consider the problem of minimizing a supermodular set function on comatroid whose special case is the well-known NP-hard minimization p-median problem. The main result of the paper is a tight bound on the performance guarantee of a greedy heuristic for this problem. As a corollary an analog of the Rado–Edmonds theorem for comatroids is obtained.

Reviews

Required fields are marked *. Your email address will not be published.