On the Approximability of NP-complete Optimization Problems
On the Approximability of NP-complete Optimization Problems
On the Approximability of NP-complete Optimization Problems
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
iv Contents<br />
4 <strong>Approximability</strong> classes 29<br />
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 9<br />
4.2 Fptas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30<br />
4.3 Ptas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32<br />
4.4 Fptas ∞ and Ptas ∞ . . . . . . . . . . . . . . . . . . . . . . . . 33<br />
4.5 Rptas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33<br />
4.6 Apx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34<br />
4.7 <strong>NP</strong>O . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35<br />
4.8 <strong>NP</strong>O problems with polynomially bounded optimum . . . . . . 35<br />
4.9 The existence <strong>of</strong> intermediate degrees . . . . . . . . . . . . . . 37<br />
4.10 Classes defined by logical formulas . . . . . . . . . . . . . . . . 37<br />
4.10.1 Syntactic Max <strong>NP</strong> . . . . . . . . . . . . . . . . . . . 38<br />
4.10.2 Syntactic Max S<strong>NP</strong> .................. 40<br />
4.10.3 Closures <strong>of</strong> Max <strong>NP</strong> and Max S<strong>NP</strong> . . . . . . . . . . 42<br />
4.10.4 Relations between <strong>the</strong> classes Syntactic Max S<strong>NP</strong> and<br />
Max S<strong>NP</strong> ......................... 44<br />
4.10.5 New definitions <strong>of</strong> Max S<strong>NP</strong> and Max <strong>NP</strong> ....... 45<br />
4.10.6 The hierarchies Max Πi, Max Σi, Min Πi and<br />
Min Σi . . . . . . . . . . . . . . . . . . . . . . . . . . . 46<br />
4.10.7 Closures <strong>of</strong> <strong>the</strong>se classes . . . . . . . . . . . . . . . . . . 48<br />
4.10.8 O<strong>the</strong>r syntactically defined classes . . . . . . . . . . . . 49<br />
4.11 The Max Ind Set class . . . . . . . . . . . . . . . . . . . . . . 52<br />
5 Matching and packing problems 54<br />
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54<br />
5.2Maximum three dimensional matching . . . . . . . . . . . . . . 54<br />
5.3 Maximum three-set packing . . . . . . . . . . . . . . . . . . . . 61<br />
5.4 Maximum k-set packing . . . . . . . . . . . . . . . . . . . . . . 62<br />
5.5 Maximum k-dimensional matching . . . . . . . . . . . . . . . . 63<br />
5.6 Maximum triangle packing. . . . . . . . . . . . . . . . . . . . . 63<br />
5.7 Maximum H-matching . . . . . . . . . . . . . . . . . . . . . . . 64<br />
6 Maximum common subgraph problems 74<br />
6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74<br />
6.2 Maximum common induced subgraph . . . . . . . . . . . . . . 74<br />
6.2.1 Approximation <strong>of</strong> maximum bounded common induced<br />
subgraph . . . . . . . . . . . . . . . . . . . . . . . . . . 75<br />
6.2.2 Approximation <strong>of</strong> maximum unbounded common induced<br />
subgraph . . . . . . . . . . . . . . . . . . . . . . . . . . 80<br />
6.3 Maximum common edge subgraph . . . . . . . . . . . . . . . . 82<br />
6.3.1 Approximation <strong>of</strong> maximum bounded common edge subgraph<br />
............................ 82<br />
6.3.2Approximation <strong>of</strong> maximum unbounded common edge<br />
subgraph . . . . . . . . . . . . . . . . . . . . . . . . . . 85<br />
6.4 Maximum common induced connected subgraph . . . . . . . . 86