Pages that link to "Item:Q3581406"

The following pages link to O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (Q3581406):

Displaying 45 items.

• Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
• Approximation algorithms for digraph width parameters (Q476883) (← links)
• Separator-based data reduction for signed graph balancing (Q613659) (← links)
• The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
• \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
• The multi-multiway cut problem (Q884458) (← links)
• Finding small stabilizers for unstable graphs (Q896265) (← links)
• Approximation algorithms for the Bipartite Multicut problem (Q991784) (← links)
• An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
• Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
• Stabilizing network bargaining games by blocking players (Q1801001) (← links)
• On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
• Faster graph bipartization (Q2301359) (← links)
• Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
• On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
• Approximation of the quadratic set covering problem (Q2427697) (← links)
• Inoculation strategies for victims of viruses and the sum-of-squares partition problem (Q2507699) (← links)
• New algorithms for a simple measure of network partitioning (Q2700788) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
• Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
• Stabilizing Network Bargaining Games by Blocking Players (Q3186500) (← links)
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Approximation Algorithms for CSPs (Q4993604) (← links)
• Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
• Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
• (Q5091036) (← links)
• An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
• The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
• The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case (Q5449665) (← links)
• The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ ₁ (Q5501953) (← links)
• (Q5743380) (← links)
• (Q5875482) (← links)
• Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
• Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
• A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
• Approximation algorithm for minimum \(q\)-dominator partization problem (Q6542935) (← links)