## Analysis and design of algorithms in combinatorial optimization |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

NonDeterministic Polynomial Optimization Problems and Their Approximation | 1 |

A Characterization of Reductions Among Combinatorial Problems | 37 |

A Recursive Approach to the Implementation of Enumerative Methods | 65 |

Copyright | |

5 other sections not shown

### Other editions - View all

Analysis and Design of Algorithms in Combinatorial Optimization Giorgio Ausiello,M. Lucertini Limited preview - 2014 |

Analysis and Design of Algorithms in Combinatorial Optimization Giorgio Ausiello,M. Lucertini No preview available - 1981 |

Analysis and Design of Algorithms in Combinatorial Optimization Giorgio Ausiello,M. Lucertini No preview available - 2014 |

### Common terms and phrases

A,t)EXT adjacency lists approximation algorithms arc weight asymptotic worst augmenting path blem branch-and-bound capacity Coffman combinatorial optimization combinatorial problems complexity consider constraints corresponding data structure defined DEFINITION dual feasibility example exists FFDH figure FIT DECREASING flow network forward arcs fully p-approximable given graph input integer item sizes label lb(Y Lemma Lenstra lower bound matroid MAX ROOTED MAX-CLIQUE max-flow min-cut theorem MIN-SET-COVERING minimal minimum-change multiprocessor scheduling network flow NODE COVER NP-complete NP-complete problems NPCO problems NPOP's number of bins number of items obtained on-line algorithm one-dimensional op(a optimal solution optimization problems packing algorithms packing problem partial order partition permutations polymatroidal polynomial prime rectangles procedure proof proved Rinnooy ROOTED FLOW saturated set scheduling solve spanning tree step strip packing structure preserving reduction subset tion tree weight functions variables variants vector vertex vertices weight function