skip to content
The shortest network problem Preview this item
ClosePreview this item
Checking...

The shortest network problem

Author: Ronald L Graham; Larry Mondi; AT & T Bell Laboratories.; University Video Communications.
Publisher: Stanford CA : University Video Communications, ©1988.
Series: Faculty of Social Sciences distinguished lecture series., Vol. II.
Edition/Format:   VHS video : VHS tape   Visual material : EnglishView all editions and formats
Database:WorldCat
Summary:
Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NP-completeness, a fundamental concept in theoretical computer science.
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

Material Type: Videorecording
Document Type: Visual material
All Authors / Contributors: Ronald L Graham; Larry Mondi; AT & T Bell Laboratories.; University Video Communications.
OCLC Number: 20712845
Notes: "Industry leaders in computer science and electrical engineering."
Sponsored by AT & T Bell Laboratories.
Credits: Executive producers, Judith Lemon, Karen Mathews; producer, Larry Mondi; graphics, Media West.
Event notes: Recorded Oct. 28, 1988.
Description: 1 videocassette (54 min.) : sd., col. ; 1/2 in.
Details: VHS format.
Series Title: Faculty of Social Sciences distinguished lecture series., Vol. II.
Responsibility: Ronald L. Graham ; produced by University Video Communications ; producer, Larry Mondi.

Abstract:

Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NP-completeness, a fundamental concept in theoretical computer science.

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/20712845>
library:oclcnum"20712845"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/20712845>
rdf:typeschema:Movie
rdf:typej.2:VHS
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:copyrightYear"1988"
schema:creator
schema:datePublished"1988"
schema:description"Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NP-completeness, a fundamental concept in theoretical computer science."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/22188173>
schema:inLanguage"en"
schema:name"The shortest network problem"@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.