Pages that link to "Item:Q1577011"
From MaRDI portal
The following pages link to An improved approximation algorithm of MULTIWAY CUT. (Q1577011):
Displaying 50 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)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← 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)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← 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)
- Discrete and continuous models for partitioning problems (Q2254249) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Optimal 3-terminal cuts and linear programming (Q2490332) (← links)
- On a bidirected relaxation for the MULTIWAY CUT problem (Q2565851) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- A 2-approximation algorithm for the directed multiway cut problem (Q2784466) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- (Q5089231) (← links)
- (Q5091157) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313023) (← links)
- Algorithm Theory - SWAT 2004 (Q5315379) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
- Improving the integrality gap for multiway cut (Q5918912) (← links)
- Improving the integrality gap for multiway cut (Q5919382) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
