Abstract
We give a unified treatment to optimization problems that can be expressed in the form of nonnegative-real-weighted Boolean constraint satisfaction problems. Creignou, Khanna, Sudan, Trevisan, and Williamson studied the complexity of approximating their optimal solutions whose optimality is measured by the sums of outcomes of constraints. To explore a wider range of optimization constraint satisfaction problems, following an early work of Marchetti-Spaccamela and Romano, we study the case where the optimality is measured by products of constraints’ outcomes. We completely classify those problems into three categories: PO problems, NPO-hard problems, and intermediate problems that lie between the former two categories. To prove this trichotomy theorem, we analyze characteristics of nonnegative-real-weighted constraints using a variant of the notion of T-constructibility developed earlier for complex-weighted counting constraint satisfaction problems.
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
Ausiello, G., Marchetti-Spaccamela, A., Protasi, M.: Full Approximability of a Class of Problems Over Power Sets. In: Astesiano, E., Böhm, C. (eds.) CAAP 1981. LNCS, vol. 112, pp. 76–87. Springer, Heidelberg (1981)
Boyd, S., Kim, S.J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optm. Eng. 8, 67–127 (2007)
Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. System Sci. 51, 511–522 (1995)
Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: The relative complexity of approximating counting problems. Algorithmica 38, 471–500 (2003)
Ibarra, O.H., Kim, C.E.: Fast approximation for the knapsack and sum of subset problems. J. ACM 22, 463–468 (1975)
Konno, H., Kuno, T.: Linear multiplicative programming. Math. Program. 56, 51–64 (1992)
Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30, 1863–1920 (2001)
Marchetti-Spaccamela, A., Romano, S.: On different approximation criteria for subset product problems. Inform. Process. Lett. 21, 213–218 (1985)
Papadimitriou, C., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci. 43, 425–440 (1991)
Yamakami, T.: Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol. 6534, pp. 261–272. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamakami, T. (2011). Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)