448 search results - page 11 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
ALGORITHMICA
2007
13 years 8 months ago
2007
CN
2006
13 years 8 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
FOCS
1991
IEEE
14 years 4 days ago
1991
IEEE
FMCAD
2007
Springer
14 years 2 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...