A 2.5 Approximation Algorithm for the Multi-Via Assignment Problem

Thang Nguyen Bui, Willie Hsu, Sing Ling Lee

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

An important phase in the single row routing approach for multilayer printed circuit board routing is the via assignment phase. The via assignment problem, whose objective is to minimize the number of via columns used, is known to be NP-hard even when each net includes at most three vias. In this paper, we develop efficient approximation algorithms for solving this problem. When the size of each net is bounded by three, we present an algorithm which guarantees that the solution generated uses no more than 2OPTC — 1 via columns, and no more than [(4/3)OPTv \ vias, where OPTcand OPTvare the number of via columns and vias in an optimal solution. We then extend our result to the case that the nets have arbitrary sizes. An efficient algorithm is presented which guarantees the solution generated uses no more than [2.5OPTc] via columns and no more than [1.5OPTV] vias in the worst case.

Original languageEnglish (US)
Pages (from-to)1325-1333
Number of pages9
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume11
Issue number11
DOIs
StatePublished - Nov 1992

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A 2.5 Approximation Algorithm for the Multi-Via Assignment Problem'. Together they form a unique fingerprint.

  • Cite this