↓ Skip to main content
What is this page? Embed badge

Analysis and Design of Algorithms in Combinatorial Optimization

Overview of attention for book
Cover of 'Analysis and Design of Algorithms in Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Non-Deterministic Polynomial Optimization Problems and Their Approximation
  3. Altmetric Badge
    Chapter 2 A Characterization of Reductions among Combinatorial Problems
  4. Altmetric Badge
    Chapter 3 A Recursive Approach to the Implementation of Enumerative Methods
  5. Altmetric Badge
    Chapter 4 Data Structures for Combinatorial Problems
  6. Altmetric Badge
    Chapter 5 Data Structures for Bidimensional Memory
  7. Altmetric Badge
    Chapter 6 Complexity of Optimum Undirected Tree Problems: A Survey of Recent Results
  8. Altmetric Badge
    Chapter 7 An Introduction to Polymatroidal Network Flows
  9. Altmetric Badge
    Chapter 8 Approximation Algorithms for Bin Packing Problems: A Survey
  10. Altmetric Badge
    Chapter 9 Additional Constraints in the Group Theoretical Approach to Integer Programming
Attention for Chapter 1: Non-Deterministic Polynomial Optimization Problems and Their Approximation
Altmetric Badge
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Non-Deterministic Polynomial Optimization Problems and Their Approximation
Chapter number 1
Book title
Analysis and Design of Algorithms in Combinatorial Optimization
Published by
Springer, Vienna, January 1981
DOI 10.1007/978-3-7091-2748-3_1
Book ISBNs
978-3-21-181626-4, 978-3-70-912748-3
Authors

A. Paz, S. Moran, Paz, A., Moran, S.

View on publisher site

This page is provided by Altmetric.