- Preview Available
- Dissertation or Thesis
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
I. A LAGRANGIAN RELAXATION METHOD FOR TESTING THE INFEASIBILITY OF CERTAIN VLSI ROUTING PROBLEMS. II. EFFICIENT REDUCTION OF PLANAR NETWORKS FOR SOLVING CERTAIN COMBINATORIAL PROBLEMSFEO, THOMAS AURELIO.
University of California, Berkeley ProQuest Dissertations & Theses, 1985. 8610009.





