Minimizing Channel Density with Movable Terminals

Ronald I. Greenberg, Jau-Der Shih

Research output: Contribution to journalArticlepeer-review

Abstract

We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.

Original languageAmerican English
JournalComputer Science: Faculty Publications and Other Works
DOIs
StatePublished - Mar 1 1993

Keywords

  • computer science

Disciplines

  • Computer Sciences
  • Theory and Algorithms
  • VLSI and Circuits, Embedded and Hardware Systems

Cite this