@InProceedings{BB04,
author = {Blesa, M. and Blum, C.},
title = {Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem},
booktitle = {1st European Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems (EvoCOMNET'04), in Applications of Evolutionary Computing (EvoWorkshops'04)},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag Heidelberg},
volume = {3005},
editor = {Raidl et al.},
pages = {160--169},
year = {2004},
month = {April},
address = {Coimbra, Portugal},
isbn = {3-540-21378-3},
url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3005&spage=160}
}
@InBook{Kar72,
author = {Karp, R.M.},
title = {Compexity of Computer Computations},
chapter = {Reducibility among combinatorial problems},
publisher = {Miller, R.E. and Thatcher, J.W. (Eds.). Plenum Press},
year = {1972},
address = {New York},
pages = {85--103}
}
@PhdThesis{Kle96,
author = {Kleinberg, J.},
title = {Approximation algorithms for disjoint paths problems},
school = {MIT},
year = {1996},
address = {Cambridge, MA},
month = {May}
}
@Article{MP93,
author = {Middendorf, M. and Pfeiffer, F.},
title = {On the Complexity of the Disjoint Path Problem},
journal = {Combinatorica},
year = {1993},
volume = {13},
pages = {97--107}
}
@Article{Vyg95,
author = {Vygen, J.},
title = {{NP}-Completeness of Some Edge-Disjoint Paths Problems},
journal = {Discrete Applied Mathematics},
volume = {61},
pages = {83--90},
year = {1995}
}