A simple approximation algorithm for two problems in circuit design

This paper provides a very simple two-approximation algorithm for two NP-hard problems that arise in electronic circuit design. To our knowledge, this is the best approximation bound known for these problems. In addition, the simplicity of the proposed algorithm makes it attractive for real-time app...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computers 1998-11, Vol.47 (11), p.1310-1312
Hauptverfasser:	Carpenter, T., Cosares, S., Ganley, J.L., Saniee, I.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithmics. Computability. Computer arithmetics Applied sciences Approximation algorithms Circuit synthesis Clocks Computer science control theory systems Design. Technologies. Operation analysis. Testing Electronic circuits Electronics Exact sciences and technology Information retrieval. Graph Integrated circuits NP-hard problem Parallel processing Routing Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Telecommunication congestion control Theoretical computing Wires
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper provides a very simple two-approximation algorithm for two NP-hard problems that arise in electronic circuit design. To our knowledge, this is the best approximation bound known for these problems. In addition, the simplicity of the proposed algorithm makes it attractive for real-time applications for similar problems in areas such as telecommunications and parallel processing.
ISSN:	0018-9340 1557-9956
DOI:	10.1109/12.736445