{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:00Z","timestamp":1759063440241,"version":"3.30.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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":4611,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0166-218x(00)00244-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:56:47Z","timestamp":1027630607000},"page":"41-59","source":"Crossref","is-referenced-by-count":6,"title":["Approximating a generalization of MAX 2SAT and MIN 2SAT"],"prefix":"10.1016","volume":"107","author":[{"given":"Dorit S.","family":"Hochbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anu","family":"Pathria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00244-4_BIB1","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00244-4_BIB2","doi-asserted-by":"crossref","unstructured":"U. Feige, M. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proceedings of the Third Israeli Symposium on the Theory of Computing and Systems, 1995, pp. 182\u2013189.","DOI":"10.1109\/ISTCS.1995.377033"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness.","author":"Garey","key":"10.1016\/S0166-218X(00)00244-4_BIB3"},{"issue":"2","key":"10.1016\/S0166-218X(00)00244-4_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S0097539793243016","article-title":"Approximate max-flow min-(multi)cut theorems and their applications","volume":"25","author":"Garg","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0166-218X(00)00244-4_BIB5","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0166-218X(00)00244-4_BIB6","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1093\/forestscience\/43.4.544","article-title":"Forest harvesting and minimum cuts","volume":"43","author":"Hochbaum","year":"1997","journal-title":"Forest Sci."},{"key":"10.1016\/S0166-218X(00)00244-4_BIB7","unstructured":"D.S. Hochbaum, A framework for half integrality and good approximations, Manuscript, UC Berkeley, June 1997."},{"issue":"3","key":"10.1016\/S0166-218X(00)00244-4_BIB8","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1093\/forestscience\/38.3.489","article-title":"Spacial optimization for wildlife and timber in managed forest ecosystems","volume":"38","author":"Hof","year":"1992","journal-title":"Forest Science"},{"year":"1972","series-title":"Introduction to the Methodology of Switching Circuits","author":"Klir","key":"10.1016\/S0166-218X(00)00244-4_BIB9"},{"key":"10.1016\/S0166-218X(00)00244-4_BIB10","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1137\/S0097539796309326","article-title":"Derandomizing approximation algorithms based on semidefinite programming","volume":"28","author":"Mahajan","year":"1999","journal-title":"SIAM J. Comput."},{"year":"1984","series-title":"Digital Design","author":"Morris Mano","key":"10.1016\/S0166-218X(00)00244-4_BIB11"},{"year":"1970","series-title":"Boolean Algebra and Switching Circuits","author":"Mendelson","key":"10.1016\/S0166-218X(00)00244-4_BIB12"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T10:05:37Z","timestamp":1733393137000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0166218X00002444"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00244-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}