A faster approximation scheme for timing driven minimum cost layer assignment.
Shiyan HuZhuo LiCharles J. AlpertPublished in: ISPD (2009)
Keyphrases
- minimum cost
- approximation algorithms
- polynomial time approximation
- np hard
- approximation ratio
- approximation schemes
- spanning tree
- network flow
- capacity constraints
- network flow problem
- worst case
- special case
- minimum cost flow
- network simplex algorithm
- integrality gap
- constant factor
- search algorithm
- randomized approximation
- approximation guarantees
- network design problem
- undirected graph
- scheduling problem
- multi objective