scientific article
From MaRDI portal
Publication:3549611
zbMath1232.68062MaRDI QIDQ3549611
Julia Chuzhoy, Sanjeev Khanna, Kunal Talwar, Venkatesan Guruswami
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Unnamed Item ⋮ Configuration balancing for stochastic requests ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs ⋮ Routing in Undirected Graphs with Constant Congestion
This page was built for publication:
