scientific article; zbMATH DE number 1775387
From MaRDI portal
Publication:4542519
Recommendations
Cited in
(51)- A new technique for the link slice problem
- An improved partial solution to the task assignment and multiway cut problems
- Minimum multiway cuts in trees
- An improved approximation algorithm of MULTIWAY CUT.
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts
- _p-norm multiway cut
- Mixed-case community detection problem in social networks: algorithms and analysis
- A simple algorithm for the multiway cut problem
- Approximation algorithms for vertex happiness
- Optimal 3-terminal cuts and linear programming
- On a bidirected relaxation for the MULTIWAY CUT problem
- Extended cuts
- A 2-approximation algorithm for the directed multiway cut problem
- Algorithms and formulations for the minimum cut separator problem
- On the minimum cut separator problem
- From graph to hypergraph multiway partition: is the single threshold the only route?
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut
- Lifting methods for manifold-valued variational problems
- Approximation Algorithms for Graph Homomorphism Problems
- Geometric rounding: A dependent randomized rounding scheme
- scientific article; zbMATH DE number 1342124 (Why is no real title available?)
- Analysis of LP relaxations for multiway and multicut problems
- scientific article; zbMATH DE number 2038710 (Why is no real title available?)
- scientific article; zbMATH DE number 2081031 (Why is no real title available?)
- Simple and fast rounding algorithms for directed and node-weighted multiway cut
- Packing multiway cuts in capacitated graphs
- On minimum 3-cuts and approximating k-cuts using cut trees
- Multiway cuts in node weighted graphs
- Approximation Algorithms for CSPs
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems
- Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
- Multiway cut, pairwise realizable distributions, and descending thresholds
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Algorithm Theory - SWAT 2004
- Approximation Algorithms for k-Hurdle Problems
- The Steiner k-Cut Problem
- A polynomial-time approximation scheme for planar multiway cut
- Improving the integrality gap for multiway cut
- Improving the integrality gap for multiway cut
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
- Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
- Approximation algorithms for feasible cut and multicut problems
- A local search approximation algorithm for the multiway cut problem
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- Lower bounds on 0-extension with Steiner nodes
- Minimal multicut and maximal integer multiflow: a survey
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem
- The multi-multiway cut problem
- Simple and improved parameterized algorithms for multiterminal cuts
- An improved approximation algorithm for requirement cut
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 Q4542519)
