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

Recent Advances in Algorithms and Combinatorics

Overview of attention for book
Cover of 'Recent Advances in Algorithms and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Matching Lattice
  3. Altmetric Badge
    Chapter 2 Discrete Mathematics and Radio Channel Assignment
  4. Altmetric Badge
    Chapter 3 Recent Advances in Algorithms and Combinatorics
  5. Altmetric Badge
    Chapter 4 Algorithmic Aspects of Tree Width
  6. Altmetric Badge
    Chapter 5 A Survey on Clique Graphs
  7. Altmetric Badge
    Chapter 6 Semidefinite Programs and Combinatorial Optimization
  8. Altmetric Badge
    Chapter 7 Approximability of NP-Optimization Problems
  9. Altmetric Badge
    Chapter 8 Pattern Inference under many Guises
  10. Altmetric Badge
    Chapter 9 Szemerédi’s Regularity Lemma and Quasi-randomness
Attention for Chapter 7: Approximability of NP-Optimization Problems
Altmetric Badge

Citations

dimensions_citation
10 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
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
Approximability of NP-Optimization Problems
Chapter number 7
Book title
Recent Advances in Algorithms and Combinatorics
Published by
Springer, New York, NY, January 2003
DOI 10.1007/0-387-22444-0_7
Book ISBNs
978-1-4684-9268-2, 978-0-387-22444-2
Authors

A. Steger

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 2 100%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.