TY - JOUR
T1 - A new approach for approximating node deletion problems
AU - Okun, Michael
AU - Barak, Amnon
PY - 2003/12/16
Y1 - 2003/12/16
N2 - We present a new approach for approximating node deletion problems by combining the local ratio and the greedy multicovering algorithms. For a function f : V(G) → ℕ, our approach allows to design a 2 + max v∈V(G) log f (v) approximation algorithm for the problem of deleting a minimum number of nodes so that the degree of each node v in the remaining graph is at most f(v). This approximation ratio is shown to be asymptotically optimal. The new method is also used to design a 1 + (log2)(k - 1) approximation algorithm for the problem of deleting a minimum number of nodes so that the remaining graph contains no k-bicliques.
AB - We present a new approach for approximating node deletion problems by combining the local ratio and the greedy multicovering algorithms. For a function f : V(G) → ℕ, our approach allows to design a 2 + max v∈V(G) log f (v) approximation algorithm for the problem of deleting a minimum number of nodes so that the degree of each node v in the remaining graph is at most f(v). This approximation ratio is shown to be asymptotically optimal. The new method is also used to design a 1 + (log2)(k - 1) approximation algorithm for the problem of deleting a minimum number of nodes so that the remaining graph contains no k-bicliques.
KW - Approximation algorithms
KW - Local ratio method
KW - Node deletion problems
UR - http://www.scopus.com/inward/record.url?scp=0242271287&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2003.08.005
DO - 10.1016/j.ipl.2003.08.005
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0242271287
SN - 0020-0190
VL - 88
SP - 231
EP - 236
JO - Information Processing Letters
JF - Information Processing Letters
IS - 5
ER -