SIAM Journal on Discrete Mathematics
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
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 Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Note: An improved randomized approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Approximability of Edge Matching Puzzles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The complexity and approximability of minimum contamination problems
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Discrete Applied Mathematics
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.00 |
The paper contributes to the systematic study (started by Berman and Karpinski) of explicit approximability lower bounds for small occurrence optimization problems.We present parametrized reductions for some packing and covering problems, including 3-Dimensional Matching, and prove the best known inapproximability results even for highly restricted versions of them. For example, we show that it is NP-hard to approximate Max-3-DM within 139/138 even on instances with exactly two occurrences of each element. Previous known hardness results for bounded occurence case of the problem required that the bound is at least three, and even then no explicit lower bound was known. New structural results which improve the known bounds for 3-regular amplifiers and hence the inapproximability results for numerous small occurrence problems studied earlier by Berman and Karpinski are also presented.