research-article

Constrained via minimization

Authors:

K. Ahn,

S. SahniAuthors Info & Claims

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume 12, Issue 2

Pages 273 - 282

https://doi.org/10.1109/43.205007

Published: 01 November 2006 Publication History

Abstract

It is shown that the general two-layer constrained via minimization problem and the three-layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking algorithm and a heuristic algorithm for the three-layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three-layer non-HVH problems. Experimental results indicate that the heuristic generally outperforms that of K. Chang et al. (unpublished)

Cited By

View all

Cho MLu KYuan KPan D(2009)BoxRouter 2.0ACM Transactions on Design Automation of Electronic Systems10.1145/1497561.149757514:2(1-21)Online publication date: 7-Apr-2009
https://dl.acm.org/doi/10.1145/1497561.1497575
Cho MLu KYuan KPan DGielen G(2007)BoxRouter 2.0Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design10.5555/1326073.1326176(503-508)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.5555/1326073.1326176
Tang MEshraghian KHabibi D(2001)Knowledge-based genetic algorithm for layer assignmentAustralian Computer Science Communications10.5555/545595.54558823:1(184-190)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/545595.545588
Show More Cited By

Index Terms

Constrained via minimization

Index terms have been assigned to the content through auto-classification.

Recommendations

Constrained via minimization and module reorientation
Nonlocal image denoising via adaptive tensor nuclear norm minimization

Nonlocal self-similarity shows great potential in image denoising. Therefore, the denoising performance can be attained by accurately exploiting the nonlocal prior. In this paper, we model nonlocal similar patches through the multi-linear approach and ...
Fast L1---L2 Minimization via a Proximal Operator

This paper aims to develop new and fast algorithms for recovering a sparse vector from a small number of measurements, which is a fundamental problem in the field of compressive sensing (CS). Currently, CS favors incoherent systems, in which any two ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems Volume 12, Issue 2

November 2006

177 pages

ISSN:0278-0070

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 November 2006

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cho MLu KYuan KPan D(2009)BoxRouter 2.0ACM Transactions on Design Automation of Electronic Systems10.1145/1497561.149757514:2(1-21)Online publication date: 7-Apr-2009
https://dl.acm.org/doi/10.1145/1497561.1497575
Cho MLu KYuan KPan DGielen G(2007)BoxRouter 2.0Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design10.5555/1326073.1326176(503-508)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.5555/1326073.1326176
Tang MEshraghian KHabibi D(2001)Knowledge-based genetic algorithm for layer assignmentAustralian Computer Science Communications10.5555/545595.54558823:1(184-190)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/545595.545588
Tang MEshraghian KHabibi DOudshoorn M(2001)Knowledge-based genetic algorithm for layer assignmentProceedings of the 24th Australasian conference on Computer science10.5555/545564.545588(184-190)Online publication date: 29-Jan-2001
https://dl.acm.org/doi/10.5555/545564.545588
Chou YLin YYasuura H(1998)A graph-partitioning-based approach for multi-layer constrained via minimizationProceedings of the 1998 IEEE/ACM international conference on Computer-aided design10.1145/288548.289065(426-429)Online publication date: 1-Nov-1998
https://dl.acm.org/doi/10.1145/288548.289065
Chang CCong JYoffa EDe Micheli GRabaey J(1997)An efficient approach to multi-layer layer assignment with application to via minimizationProceedings of the 34th annual Design Automation Conference10.1145/266021.266294(600-603)Online publication date: 13-Jun-1997
https://dl.acm.org/doi/10.1145/266021.266294
Shi CVannelli AVlach J(1997)Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph PartitioningJournal of Heuristics10.1023/A:10096831100273:3(225-243)Online publication date: 1-Nov-1997
https://dl.acm.org/doi/10.1023/A%3A1009683110027

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations