SIAM Journal on Discrete Mathematics
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
On approximating four covering and packing problems
Journal of Computer and System Sciences
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Coalition formation for task allocation: theory and algorithms
Autonomous Agents and Multi-Agent Systems
Improved approximations for k-exchange systems
ESA'11 Proceedings of the 19th European conference on Algorithms
ACM Transactions on Algorithms (TALG)
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Competitive router scheduling with structured data
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Price of Correlations in Stochastic Optimization
Operations Research
Overflow management with multipart packets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Welfare maximization and the supermodular degree
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
A graph is d-claw free if no node has d distinct independent neighbors. In the most usual applications, the nodes of this graph form a family of sets with fewer than d elements, and the edges indicate overlapping pairs of sets. Consequently, an independent set in the graph is a packing in our family of sets. In this paper we consider the following problem. Given is a d-claw free graph G = (V, E, w) where w : V → IR+. We describe an algorithm with running time polynomial in |V|d that 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.