scientific article
From MaRDI portal
Publication:3549676
zbMath1231.68140MaRDI QIDQ3549676
Roy Schwartz, Prasad Raghavendra, Raisekar Manokaran, Joseph (Seffi) Naor
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
On the (near) optimality of extended formulations for multi-way cut in social networks ⋮ \(\ell_p\)-norm multiway cut ⋮ Global and fixed-terminal cuts in digraphs ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem ⋮ Unnamed Item ⋮ Hardness of approximation for crossing number ⋮ Sperner’s Colorings and Optimal Partitioning of the Simplex ⋮ A tight \(\sqrt{2} \)-approximation for linear 3-cut ⋮ On the generalized multiway cut in trees problem ⋮ Geometric multicut: shortest fences for separating groups of objects in the plane ⋮ Approximation Algorithms for CSPs ⋮ Approximating the Noise Sensitivity of a Monotone Boolean Function ⋮ Odd Multiway Cut in Directed Acyclic Graphs ⋮ A simple algorithm for the multiway cut problem ⋮ Improving the integrality gap for multiway cut ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Beating the 2-approximation factor for global bicut ⋮ Simplex Transformations and the Multiway Cut Problem ⋮ Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
This page was built for publication:
