SIAM Journal on Discrete Mathematics
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Parameterized Algorithms for Weighted 3-Set Packing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Externalities among advertisers in sponsored search
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
| Hi-index | 0.00 |
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.