"Parallel approximation algorithms for bin packing" - Information and Links:

Parallel approximation algorithms for bin packing - Info and Reading Options

"Parallel approximation algorithms for bin packing" was published by Dept. of Computer Science, Stanford University in 1988 - Stanford, Calif, it has 14 pages and the language of the book is English.


“Parallel approximation algorithms for bin packing” Metadata:

  • Title: ➤  Parallel approximation algorithms for bin packing
  • Author:
  • Language: English
  • Number of Pages: 14
  • Publisher: ➤  Dept. of Computer Science, Stanford University
  • Publish Date:
  • Publish Location: Stanford, Calif

“Parallel approximation algorithms for bin packing” Subjects and Themes:

Edition Specifications:

  • Pagination: 14 p. :

Edition Identifiers:

  • The Open Library ID: OL2233625M - OL4800097W
  • Online Computer Library Center (OCLC) ID: 19273354
  • Library of Congress Control Number (LCCN): 89102082

AI-generated Review of “Parallel approximation algorithms for bin packing”:


Read “Parallel approximation algorithms for bin packing”:

Read “Parallel approximation algorithms for bin packing” by choosing from the options below.

Search for “Parallel approximation algorithms for bin packing” downloads:

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

Find “Parallel approximation algorithms for bin packing” in Libraries Near You:

Read or borrow “Parallel approximation algorithms for bin packing” from your local library.

Buy “Parallel approximation algorithms for bin packing” online:

Shop for “Parallel approximation algorithms for bin packing” on popular online marketplaces.