The Minimum Reload s-t Path/Trail/Walk Problems-Reference-Cited by-同舟云学术

The Minimum Reload s-t Path/Trail/Walk Problems

Published:2009 Issue: Volume: Page:621-632
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gourvès Laurent,Lyra Adria,Martinhon Carlos,Monnot Jérôme

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-95891-8_55

Reference8 articles.

1. Abouelaoualim, A., Das, K.C., Faria, L., Manoussakis, Y., Martinhon, C.A., Saad, R.: Paths and trails in edge -colored graphs. Theoretical Computer Science 409(3), 497–510 (2008)

2. Amaldi, E., Galbiati, G., Maffioli, F.: On minimum reload cost paths, tours and flows. In: Proc. of the Cologne Twente Worshop (CTW 2008) (2008)

3. Berman, P., Karpinski, M., Scott, A.D.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 49 (2003)

4. Galbiati, G.: The complexity of a minimum reload cost diameter problem. Discrete Applied Mathematics (article in press, 2008)

5. Gamvros, I.: Satellite network design, optimization and management PhD thesis, University of Maryland (2006)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum color‐degree perfect b ‐matchings;Networks;2020-09-10

2. On Solving the Quadratic Shortest Path Problem;INFORMS Journal on Computing;2019-11-13

3. Reload cost trees and network design;Networks;2011-08-01

4. On Minimum Changeover Cost Arborescences;Experimental Algorithms;2011

5. On minimum reload cost paths, tours, and flows;Networks;2010-12-22