Abstract
We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MIN-LIN2 and a MIN-BISECTION problem for graphs. MIN-LIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that satisfies the minimum number of them. E3-OCC-MIN-E3-LIN2 is the bounded occurrence (degree) problem restricted as follows: each equation has exactly 3 variables and each variable occurs in exactly 3 equations. Clearly, MIN-LIN2 is equivalent to another well known problem, the Nearest Codeword problem, and E3-OCC-MIN-E3-LIN2 to its bounded occurrence version. MIN-BISECTION is a problem of finding a minimum bisection of a graph, while 3-MIN-BISECTION is the MIN-BISECTION problem restricted to 3-regular graphs only. We show that, somewhat surprisingly, these two restricted problems are exactly as hard to approximate as their general versions. In particular, an approximation ratio lower bound for E3-OCC-MIN-E3-LIN2 (bounded 3-occurrence 3-ary Nearest Codeword problem) is equal to MIN-LIN2 (Nearest Codeword problem) lower bound n Ω(1)/log log n. Moreover, an existence of a constant factor approximation ratio (or a PTAS) for 3-MIN-BISECTION entails existence of a constant approximation ratio (or a PTAS) for the general MIN-BISECTION.
Visiting from Pensylvania State University. Partially supported by DFG grant Bo 56/157-1 and NSF grant CCR-9700053.
Research partially done while visiting Dept. of Computer Science, Yale University. Supported in part by DFG grants KA 673/4-1 and Bo 56/157, DIMACS, and IST grant 14036 (RAND-APX).
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
S. Arora, C. Lund, Hardness of Approximations, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum (ed.), PWS Publishing, Boston 1995, 399–446.
C. Bazgan, W. Fernandez de la Vega and M. Karpinski, Approximability of dense instances of NEAREST CODEWORD problem, ECCC Tech. Report TR00-091, 2000, to appear in Proc. 8th SWAT (2002).
P. Berman and M. Karpinski, On some tighter inapproximability results, Proc. of 26th ICALP, LNCS 1644, Springer-Verlag, Berlin, 1999, 200–209.
P. Berman and M. Karpinski, Approximating Minimum Unsatisfiability of Linear Equations, ECCC Technical Report, TR01-025, 2001, also in Proc. 13th ACM-SIAM SODA (2002), 514–516.
T. N. Bui and C. Jones, Finding Good Approximate Vertex and Edge Partitions is Hard, Inform. Process. Letters 42 (1992), 153–159.
O. Gabber and Z. Galil, Explicit construction of linear size superconcentrators, JCSS 22(1981), 407–420.
I. Dinur, G. Kindler and S. Safra, Approximating CVP to within almost polynomial factors is NP-hard, Proc. of 39th IEEE FOCS, 1998, 99–109.
I. Dinur, G. Kindler, R. Raz and S. Safra, An improved lower bound for approximating CVP, 2000, submitted.
U. Feige and R. Krauthgamer, A Polylogarithmic Approximation of the Minimum Bisection, Proc. 41st IEEE FOCS (2000), pp. 105–115.
S. Khanna, M. Sudan and L. Trevisan, Constraint Satisfaction: the approximability of minimization problems, Proc. of 12th IEEE Computational Complexity 1997, 282–296.
A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), 261–277.
C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, JCSS 43, 1991, pp. 425–440.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, P., Karpinski, M. (2002). Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_53
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive