div class=ts-pagebuttonPage 1button div class=ts-image a href=https:reader043vdocumentinreader043viewer20220204135b5244197f8b9a7b648d1017html5page1jpg target=_blank amp-img class=ts-thumb alt=Page 1: Source: M Garey and D S Johnson Computers and · almost as good The theory of NP-completeness provides many straightfor- ward techniques for proving that a given problem src=https:reader043vdocumentinreader043viewer20220204135b5244197f8b9a7b648d1017html5thumbnails1jpg width=142 height=106 layout=responsive amp-imga divpSource: M Garey and D S Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness W H Freemand and Company San Francisco CA 1979 pp 2–3p p1pdivdiv class=ts-pagebuttonPage 2button div class=ts-image a href=https:reader043vdocumentinreader043viewer20220204135b5244197f8b9a7b648d1017html5page2jpg target=_blank amp-img class=ts-thumb alt=Page 2: Source: M Garey and D S Johnson Computers and · almost as good The theory of NP-completeness provides many straightfor- ward techniques for proving that a given problem src=https:reader043vdocumentinreader043viewer20220204135b5244197f8b9a7b648d1017html5thumbnails2jpg width=142 height=106 layout=responsive amp-imga divp2pdivdiv class=ts-pagebuttonPage 3button div class=ts-image a href=https:reader043vdocumentinreader043viewer20220204135b5244197f8b9a7b648d1017html5page3jpg target=_blank amp-img class=ts-thumb alt=Page 3: Source: M Garey and D S Johnson Computers and · almost as good The theory of NP-completeness provides many straightfor- ward techniques for proving that a given problem src=https:reader043vdocumentinreader043viewer20220204135b5244197f8b9a7b648d1017html5thumbnails3jpg width=142 height=106 layout=responsive amp-imga divp3pdiv