Sciweavers

AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
13 years 9 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
AAIM
2006
Springer
134views Algorithms» more  AAIM 2006»
13 years 9 months ago
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Emgad H. Bachoore, Hans L. Bodlaender