Generalizing the maximum folding problem /
T.C. Hu, Karl Edwin Moerder, and J. David Morgenthaler

Description

Tools

Cite this Export citation file

Main Author: Hu, T. C. (Te Chiang), 1930-
Related Names: Morgenthaler, J. David
Moerder, Karl Edwin, 1956-
University of California, San Diego. Dept. of Computer Science and Engineering
Language(s): English
Published: La Jolla, Calif. : Dept. of Computer Science and Engineering, University of California, San Diego, [1991]
Physical Description: 25 leaves : ill. ; 28 cm
Locate a Print Version: Find in a library

Viewability

Item Link	Original Source
Limited (search only)	University of California

View HathiTrust MARC record

Similar Items

Ancestor tree for multi-terminal cut functions

Author: Cheng, C. K
Published: 1989

The optimal partitioning of networks

Author: Cheng, C. K
Published: 1989

Maximum concurrent flow and minimum ratio cut

Author: Cheng, C. K
Published: 1988

The orientation of modules based on graph decomposition

Author: Cheng, C. K
Published: 1988

Anatomy of on-line bin packing

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1988

The checkmate condition and the super-simplex algorithm

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1988

Optimization of globally convex functions

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1989

Combinatorial algorithms

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1982

Integer programming and network flows

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1969

Folding algorithms for an array of transistors and contacts

Author: Moerder, Karl Edwin, 1956-
Published: 1989