scientific article; zbMATH DE number 1263178
From MaRDI portal
Publication:4234048
zbMath0978.68500MaRDI QIDQ4234048
Publication date: 3 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Approximating call-scheduling makespan in all-optical networks ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints ⋮ The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Short length Menger's theorem and reliable optical routing ⋮ Maximum edge-disjoint paths in planar graphs with congestion 2 ⋮ Optimal Construction of Edge-Disjoint Paths in Random Graphs
This page was built for publication:
