scientific article; zbMATH DE number 2079369

zbMath1092.68627MaRDI QIDQ4471328

Anupam Gupta

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minimum directed multicut problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

On the Max-flow min-cut ratio for directed multicommodity flows ⋮ The multi-multiway cut problem ⋮ Approximation and Kernelization for Chordal Vertex Deletion ⋮ On the advantage of overlapping clusters for minimizing conductance ⋮ Register loading via linear programming ⋮ On the complexity of the multicut problem in bounded tree-width graphs and digraphs ⋮ The checkpoint problem ⋮ Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth ⋮ A polynomial kernel for distance-hereditary vertex deletion ⋮ Multicommodity flows and cuts in polymatroidal networks ⋮ An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut

This page was built for publication: