"Approximation algorithms for combinatorial optimization" - Information and Links:

Approximation algorithms for combinatorial optimization - Info and Reading Options

third international workshop, APPROX 2000, Saarbrucken, Germany, September 5-8, 2000 : proceedings

"Approximation algorithms for combinatorial optimization" was published by Springer in 2000 - Berlin, it has 273 pages and the language of the book is English.


“Approximation algorithms for combinatorial optimization” Metadata:

  • Title: ➤  Approximation algorithms for combinatorial optimization
  • Author: ➤  
  • Language: English
  • Number of Pages: 273
  • Publisher: Springer
  • Publish Date:
  • Publish Location: Berlin

“Approximation algorithms for combinatorial optimization” Subjects and Themes:

Edition Specifications:

  • Pagination: ix, 273 p. :

Edition Identifiers:

AI-generated Review of “Approximation algorithms for combinatorial optimization”:


Read “Approximation algorithms for combinatorial optimization”:

Read “Approximation algorithms for combinatorial optimization” by choosing from the options below.

Search for “Approximation algorithms for combinatorial optimization” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Approximation algorithms for combinatorial optimization” in Libraries Near You:

Read or borrow “Approximation algorithms for combinatorial optimization” from your local library.

Buy “Approximation algorithms for combinatorial optimization” online:

Shop for “Approximation algorithms for combinatorial optimization” on popular online marketplaces.