The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
From MaRDI portal
Publication:2753529
DOI10.1137/S0895480199361259zbMath0977.68043MaRDI QIDQ2753529
Erlebach, Thomas, Klaus Jansen
Publication date: 11 November 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Call control with \(k\) rejections ⋮ Parameterized Maximum Path Coloring ⋮ Parameterized maximum path coloring ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Competitive algorithms and lower bounds for online randomized call control in cellular networks ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Conversion of coloring algorithms into maximum weight independent set algorithms ⋮ Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees ⋮ GreedyMAX-type Algorithms for the Maximum Independent Set Problem ⋮ Robust online algorithms for dynamic choosing problems
