skip to content
Lecture notes on approximation algorithms Preview this item
ClosePreview this item
Checking...

Lecture notes on approximation algorithms

Author: Rajeev Motwani
Publisher: Stanford, CA : Dept. of Computer Science, Stanford University, [1992-
Series: Report (Stanford University. Computer Science Department), no. STAM-CS-92-1435.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) offered during the academic year 1991-92. The notes below correspond to the first half of the course. The second half consists of topics such as MAX SNP, cliques, and colorings, as well as more specialized material covering topics such as geometric problems, Steiner trees and multicommodity flows. The  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Rajeev Motwani
OCLC Number: 27938334
Notes: "June 1992"--Cover.
Description: v. <1 > ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), no. STAM-CS-92-1435.
Responsibility: Rajeev Motwani.

Abstract:

Abstract: "These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) offered during the academic year 1991-92. The notes below correspond to the first half of the course. The second half consists of topics such as MAX SNP, cliques, and colorings, as well as more specialized material covering topics such as geometric problems, Steiner trees and multicommodity flows. The second half is being revised to incorporate the implciations of recent results in approximation algorithms and the complexity of approximation problems."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/27938334>
library:oclcnum"27938334"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/27938334>
rdf:typeschema:Book
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/811830>
rdf:typeschema:Intangible
schema:name"Approximation theory--Data processing"@en
schema:name"Approximation theory--Data processing."@en
schema:about
schema:about
schema:creator
schema:datePublished"1992/"
schema:datePublished"1992/9999"
schema:description"Abstract: "These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) offered during the academic year 1991-92. The notes below correspond to the first half of the course. The second half consists of topics such as MAX SNP, cliques, and colorings, as well as more specialized material covering topics such as geometric problems, Steiner trees and multicommodity flows. The second half is being revised to incorporate the implciations of recent results in approximation algorithms and the complexity of approximation problems.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1808812203>
schema:inLanguage"en"
schema:name"Lecture notes on approximation algorithms"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.