scientific article; zbMATH DE number 6469168

MaRDI QIDQ5501283zbMATH OpenFDO

Authors Ganesh Venkataraman, Kasturi Varadarajan

Publication date 3 August 2015

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(12)

• An O( n)-approximation algorithm for directed sparsest cut
• Finding edge-disjoint paths in networks: an ant colony optimization algorithm
• On the disjoint paths problem
• Routing in undirected graphs with constant congestion
• Approximability of packing disjoint cycles
• Approximability of Packing Disjoint Cycles
• Greedy approximation algorithms for directed multicuts
• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
• The checkpoint problem
• Fair k-center clustering with minimum representation guarantees
• On the Max-flow min-cut ratio for directed multicommodity flows
• Finding disjoint paths with related path costs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501283)