The Maximum Disjoint Routing Problem

DOI10.1007/978-3-319-42634-1_26MaRDI QIDQ2817875zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The disjoint shortest paths problem
• Approximation algorithms for disjoint paths and related routing and packing problems
• The Directed Disjoint Shortest Paths Problem
• The maximum edge-disjoint paths problem in complete graphs
• Simultaneous disjoint routing in regular graphs
• The multiroute maximum flow problem revisited
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• Maximum Edge-Disjoint Paths Problem in Planar Graphs
• The undirected two disjoint shortest paths problem
• Maximum flows on disjoint paths

Cites work

• An algorithm for the maximum weight independent set problem on outerstring graphs
• Dynamic fractional cascading
• Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
• scientific article; zbMATH DE number 1629971 (Why is no real title available?)
• The minimum vulnerability problem

Cited in

(3)

• The Maximum Labeled Path Problem
• The Directed Disjoint Shortest Paths Problem
• On the maximum betweenness improvement problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817875)