Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost.
Weiping ShiZhuo LiCharles J. AlpertPublished in: ASP-DAC (2004)
Keyphrases
- minimum cost
- complexity analysis
- np hard
- approximation algorithms
- network flow
- network flow problem
- spanning tree
- network simplex algorithm
- capacity constraints
- lower bound
- computational complexity
- theoretical analysis
- minimum cost flow
- worst case
- special case
- optimal solution
- first order logic
- upper bound
- edit operations