Pages that link to "Item:Q2458939"
From MaRDI portal
The following pages link to On the hardness of approximating Multicut and Sparsest-Cut (Q2458939):
Displaying 41 items.
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- The checkpoint problem (Q714790) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- A note on unique games (Q845686) (← links)
- Partial multicuts in trees (Q861281) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem (Q2507699) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5091036) (← links)
- (Q5092461) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
