scientific article; zbMATH DE number 6469168
From MaRDI portal
Publication:5501283
zbMath1318.05083MaRDI QIDQ5501283
Ganesh Venkataraman, Kasturi R. Varadarajan
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
On the Max-flow min-cut ratio for directed multicommodity flows ⋮ On the disjoint paths problem ⋮ Finding disjoint paths with related path costs ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Approximability of Packing Disjoint Cycles ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm ⋮ Approximability of packing disjoint cycles ⋮ The checkpoint problem ⋮ Greedy approximation algorithms for directed multicuts ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut
This page was built for publication:
