Abstract
We study small degree graph problems such as MAXIMUM INDEPENDENT SET and MINIMUM NODE COVER and improve approximation lower bounds for them and for a number of related problems, like MAX-B-SET PACKING, MIN-B-SET COVER, MAX-MATCHING in B-uniform 2-regular hypergraphs. For example, we prove NP-hardness factor of 95/94 for MAX-3DM, and factor of 48/47 for MAX-4DM; in both cases the hardness result applies even to instances with exactly two occurrences of each element. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Chlebík, M., & Chlebíková, J. (2003). Inapproximability results for bounded variants of optimization problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2751, 27–38. https://doi.org/10.1007/978-3-540-45077-1_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
