SIAM Journal on Discrete Mathematics
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
An approximation algorithm for maximum packing of 3-edge paths
Information Processing Letters
On Local Search for Weighted K-Set Packing
Mathematics of Operations Research
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Better approximations for max TSP
Information Processing Letters
Greedy local improvement and weighted set packing approximation
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A Parameterized Perspective on Packing Paths of Length Two
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Induced Packing of Odd Cycles in a Planar Graph
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minimum-weight cycle covers and their approximability
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximation algorithms for restricted cycle covers based on cycle decompositions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Induced packing of odd cycles in planar graphs
Theoretical Computer Science
The path partition problem and related problems in bipartite graphs
Operations Research Letters
Discrete Applied Mathematics
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
| Hi-index | 0.05 |
We present a randomized (89169-@e)-approximation algorithm for the weighted maximum triangle packing problem, for any given @e0. This is the first algorithm for this problem whose performance guarantee is better than 12. The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.