Abstract
In this paper we consider the following problem. Given is a d-claw free graph G = (V,E,w) where w: V → R+. Our algorithm finds an independent set A such that w(A*)/w(A)≤ d/2 where A* is an independent that maximizes w(A*). The previous best polynomial time approximation algorithm obtained w(A*)/w(A)≤ 2d/3.
Research supported by NSF grant CCR-9700053,
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Bafna, B. Narayana and R. Ravi, Non-overlapping local alignments (weighted independent sets of axis parallel rectangles, WADS 1995, Springer-Verlag LNCS 955:506–517, to appear in Disc. Appl. Math.
B. Chandra and M. M. Halldórsson, Greedy local improvement and weighted packing approximation, SODA 1999.
C. A. Hurkens and A. Schrijver, One the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio heuristics for packing problems, SIAM J. Discr. Math. 2(1):68–72, Feb. 1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, P. (2000). A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive