On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems

DOI10.1007/978-3-540-74450-4_7zbMath1176.90522OpenAlexW1583955211MaRDI QIDQ3611898

Peng Zhang, Wen-Bo Zhao

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Min-sum 2-paths problems

Uses Software

• Unnamed Item

This page was built for publication: On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems