Login / Signup
A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment.
Shiyan Hu
Zhuo Li
Charles J. Alpert
Published in:
IEEE Trans. Circuits Syst. II Express Briefs (2009)
Keyphrases
</>
minimum cost
np hard
approximation algorithms
network flow
spanning tree
network flow problem
network simplex algorithm
capacity constraints
approximation schemes
worst case
linear programming
minimum cost flow
np complete
edit operations