The Maximum Disjoint Routing Problem

DOI10.1007/978-3-319-42634-1_26zbMath1394.94975OpenAlexW2504589325MaRDI QIDQ2817875

Farhad Shahmohammadi, Amir Sharif-Zadeh, Hamid Zarrabi-Zadeh

Publication date: 2 September 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• An algorithm for the maximum weight independent set problem on outerstring graphs
• Dynamic fractional cascading
• The Minimum Vulnerability Problem
• Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

This page was built for publication: The Maximum Disjoint Routing Problem