A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion.

Shiyan Hu Zhuo Li Charles J. Alpert

Published in: DAC (2009)

Keyphrases

minimum cost
np hard
network flow
spanning tree
approximation algorithms
network flow problem
capacity constraints
minimum cost flow
approximation schemes
network simplex algorithm
multi objective
np complete
undirected graph