scientific article; zbMATH DE number 5485510
From MaRDI portal
Publication:3549676
Cited in
(23)- Towards a characterization of constant-factor approximable finite-valued CSPs
- Hardness of approximation for crossing number
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- On the (near) optimality of extended formulations for multi-way cut in social networks
- _p-norm multiway cut
- A tight \(\sqrt{2} \)-approximation for linear 3-cut
- Geometric multicut: shortest fences for separating groups of objects in the plane
- A simple algorithm for the multiway cut problem
- Beating the 2-approximation factor for global bicut
- On the generalized multiway cut in trees problem
- Odd multiway cut in directed acyclic graphs
- Weakly Modular Graphs and Nonpositive Curvature
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Sperner's colorings and optimal partitioning of the simplex
- Approximation Algorithms for CSPs
- Simplex transformations and the multiway cut problem
- Global and fixed-terminal cuts in digraphs
- Parameterized algorithms for zero extension and metric labelling problems
- Approximating the Noise Sensitivity of a Monotone Boolean Function
- Improving the integrality gap for multiway cut
- Parameterized inapproximability for Steiner orientation by gap amplification
- Lower bounds on 0-extension with Steiner nodes
- Monotone submodular multiway partition
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 Q3549676)
