Finding Paths with Minimum Shared Edges
DOI10.1007/978-3-642-22685-4_49zbMath1353.68217OpenAlexW2784293985WikidataQ62037445 ScholiaQ62037445MaRDI QIDQ3087983
Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
Publication date: 17 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_49
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
This page was built for publication: Finding Paths with Minimum Shared Edges
