Pages that link to "Item:Q2819596"
From MaRDI portal
The following pages link to Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596):
Displaying 46 items.
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Optimal 3-terminal cuts and linear programming (Q2490332) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- On a bidirected relaxation for the MULTIWAY CUT problem (Q2565851) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- (Q5089231) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)
