Using well-solvable minimum cost exact covering for VLSI clock energy minimization

DOI10.1016/j.orl.2014.05.010zbMath1408.90264OpenAlexW2095063192MaRDI QIDQ1785247

Uri Wimer, Shmuel Wimer, Doron Gluzer

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.05.010

zbMATH Keywords

exact coveringmulti-bit flip-flopperfect graph matchingVLSI clockingwell-solvable problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Perfect graphs (05C17)

Related Items (1)

Easy and difficult exact covering problems arising in VLSI power reduction by clock gating

Uses Software

• Blossom V

Cites Work

• Unnamed Item
• Using well-solvable quadratic assignment problems for VLSI interconnect applications
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Efficiently solvable special cases of hard combinatorial optimization problems
• Another well-solvable case of the QAP: maximizing the job completion time variance
• A well-solvable special case of the bounded knapsack problem
• On optimal flip-flop grouping for VLSI power minimization
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

This page was built for publication: Using well-solvable minimum cost exact covering for VLSI clock energy minimization