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 \(\frac{95}{94}\) for Max-3DM, and factor of \(\frac{48}{47}\) for Max-4DM; in both cases the hardness result applies even to instances with exactly two occurrences of each element.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Kahale, N.: Approximating the independent number via the θ function. Mathematical Programming 80, 253–264 (1998)
Berman, P., Fujito, T.: Approximating independent sets in degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 449–460. Springer, Heidelberg (1995)
Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results, Further Improvements, ECCC Report TR98-065 (1998)
Berman, P., Karpinski, M.: Efficient Amplifiers and Bounded Degree Optimization, ECCC Report TR01-053 (2001)
Chlebík, M., Chlebíková, J.: Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. In: Proc. of the 5th CIAC. LNCS, vol. 2653, Springer, Heidelberg (2003) (also ECCC Report TR02-73, 2002)
Chlebík, M., Chlebíková, J.: Approximation hardness of the steiner tree problem on graphs. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 170–179. Springer, Heidelberg (2002)
Chlebík, M., Chlebíková, J.: Inapproximability results for bounded variants of optimization problems, ECCC Report TR03-26 (2003)
Chung, F.R.K.: Spectral Graph Theory, CBMS Regional Conference Series in Mathematics. AMS, ISSN 0160-7642, ISBN 0-8218-0315-8 (1997)
Clementi, A., Trevisan, L.: Improved non-approximability results for vertex cover with density constraints. Theoretical Computer Science 225, 113–128 (1999)
Dinur, I., Safra, S.: The importance of being biased, ECCC Report TR01-104 (2001)
Håstad, J.: Some optimal inapproximability results. Journal of ACM 48, 798–859 (2001)
Hazan, E., Safra, S., Schwartz, O.: On the Hardness of Approximating k-Dimensional Matching, ECCC Report TR03-20 (2003)
Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semi-definite programming. Journal of the ACM 45(2), 246–265 (1998)
Papadimitriou, C.H., Vempala, S.: On the Approximability of the Traveling Salesman Problem. In: Proc. 32nd ACM Symposium on Theory of Computing, Portland (2000)
Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. 33rd ACM Symposium on Theory of Computing (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebík, M., Chlebíková, J. (2003). Inapproximability Results for Bounded Variants of Optimization Problems. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive