scientific article; zbMATH DE number 2079393
From MaRDI portal
Publication:4471352
zbMath1092.68620MaRDI QIDQ4471352
Chandra Chekuri, Sanjeev Khanna
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Max-flow min-cut ratio for directed multicommodity flows ⋮ On the disjoint paths problem ⋮ Approximation algorithms for orienting mixed graphs ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Approximability of Packing Disjoint Cycles ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm ⋮ Disjoint paths in sparse graphs ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ A note on the greedy algorithm for the unsplittable flow problem ⋮ Flows on few paths: Algorithms and lower bounds ⋮ Flows with unit path capacities and related packing and covering problems
This page was built for publication:
