I. A LAGRANGIAN RELAXATION METHOD FOR TESTING THE INFEASIBILITY OF CERTAIN VLSI ROUTING PROBLEMS. II. EFFICIENT REDUCTION OF PLANAR NETWORKS FOR SOLVING CERTAIN COMBINATORIAL PROBLEMS - ProQuest

Skip to main content

Document Preview

Copyright information

Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.

Access to the complete full text

This is a short preview of the document. Your library or institution may give you access to the complete full text for this document in ProQuest.

Explore ProQuest

Alternatively, you can purchase a copy of the complete full text for this document directly from ProQuest using the option below:

I. A LAGRANGIAN RELAXATION METHOD FOR TESTING THE INFEASIBILITY OF CERTAIN VLSI ROUTING PROBLEMS. II. EFFICIENT REDUCTION OF PLANAR NETWORKS FOR SOLVING CERTAIN COMBINATORIAL PROBLEMS

FEO, THOMAS AURELIO. University of California, Berkeley ProQuest Dissertations Publishing, 1985. 8610009.