Fast algorithms for NP-hard problems which are optimal or near-optimal with probability one

Description

Thesis--University of Wisconsin--Madison. / Typescript. Vita. Description based on print version record. Includes bibliographical references (leaves 120-123).

Links & Downloads

1. http://catalog.hathitrust.org/api/volumes/oclc/5913656.html

Tags

Algorithms.

Additional Fields

Identifer	oai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/615302572
Date	January 1979
Creators	Terada, Routo.
Source Sets	OCLC
Language	English
Detected Language	English