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

DOI10.1007/978-3-540-95891-8_55zbMath1206.68235OpenAlexW2127499975MaRDI QIDQ3599109

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

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_55

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

On Minimum Reload Cost Cycle Cover ⋮ Reload cost trees and network design ⋮ Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ On minimum reload cost paths, tours, and flows ⋮ On Solving the Quadratic Shortest Path Problem

Cites Work

• The complexity of a minimum reload cost diameter problem
• Paths and trails in edge-colored graphs
• Reload cost trees and network design
• On minimum reload cost paths, tours, and flows
• Reload cost problems: Minimum diameter spanning tree
• Unnamed Item

This page was built for publication: The Minimum Reload s-t Path/Trail/Walk Problems