WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/2244851284

Lecture notes on approximation algorithms

Open All Close All

type

about

creator

description

http://schema.org/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.""

name

http://schema.org/name

  • "Lecture notes on approximation algorithms"

workExample