This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.... set of pairs T = {(s1, ti), ..., (sk, ty)} with si, ti an V. SOLUTION: A collection of edge disjoint paths in G connecting some of ... 1995], or more generally, if G is a nearly -Eulerian uniformly high-diameter planar graph [Kleinberg and Tardos, 1995].

Title | : | Complexity and Approximation |

Author | : | Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi |

Publisher | : | Springer Science & Business Media - 2012-12-06 |

Continue