Now showing items 1-2 of 2

    • The linear assignment problem 

      Akgül, Mustafa (Springer, 1992)
      We present a broad survey of recent polynomial algorithms for the linear assignment problem. They all use essentially alternating trees and/or strongly feasible trees. Most of them employ Dijkstra’s shortest path algorithm ...
    • Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components 

      Ilkhechi, A. R.; Korpeoglu, I.; Ulusoy, Özgür (Elsevier BV, 2015)
      Following a shift from computing as a purchasable product to computing as a deliverable service to consumers over the Internet, cloud computing has emerged as a novel paradigm with an unprecedented success in turning utility ...