{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T02:29:40Z","timestamp":1674872980036},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0304-3975(98)00343-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:43:06Z","timestamp":1027615386000},"page":"189-203","source":"Crossref","is-referenced-by-count":12,"title":["Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights"],"prefix":"10.1016","volume":"244","author":[{"given":"Peter","family":"Jonsson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(98)00343-0_BIB1","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1006\/jcss.1995.1087","article-title":"A dichotomy theorem for maximum generalized satisfiability problems","volume":"51","author":"Creignou","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00343-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.0016","article-title":"Complexity of generalized satisfiability counting problems","volume":"125","author":"Creignou","year":"1996","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/S0304-3975(98)00343-0_BIB3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00343-0_BIB4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01758838","article-title":"A bounded approximation for the minimum cost 2-Sat problem","volume":"8","author":"Gusfield","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB6","series-title":"Linear Inequalities and Related Systems","first-page":"247","article-title":"An extension of a theorem of Dantzig","author":"Heller","year":"1956"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01585160","article-title":"Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality","volume":"62","author":"Hochbaum","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB8","series-title":"Linear Inequalities and Related Systems","first-page":"223","article-title":"Integral boundary points of convex polyhedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB9","unstructured":"V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992."},{"key":"10.1016\/S0304-3975(98)00343-0_BIB10","first-page":"317","article-title":"Polynomially bounded minimization problems that are hard to approximate","volume":"1","author":"Kann","year":"1994","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0304-3975(98)00343-0_BIB11","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0304-3975(98)00343-0_BIB12","doi-asserted-by":"crossref","unstructured":"S. Khanna, M. Sudan, L. Trevisan, Constraint satisfaction: the approximability of minimization problems, in: Proc. 12th Annu. IEEE Conf. on Computational Complexity, 1997, pp. 282\u2013296.","DOI":"10.1109\/CCC.1997.612323"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB13","doi-asserted-by":"crossref","unstructured":"S. Khanna, M. Sudan, D.P. Williamson, A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction, in: Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 11\u201320.","DOI":"10.1145\/258533.258538"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB14","series-title":"Combinatorial Optimization","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB15","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer, The complexity of satisfiability problems, in: Proc. of the 10th ACM Symp. on Theory of Computing, 1978, pp. 216\u2013226.","DOI":"10.1145\/800133.804350"},{"key":"10.1016\/S0304-3975(98)00343-0_BIB16","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T01:20:17Z","timestamp":1555809617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0304397598003430"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00343-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}