Pages that link to "Item:Q1810886"

The following pages link to Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection (Q1810886):

Displaying 14 items.

• Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
• Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
• Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
• On approximation of max-vertex-cover (Q1848386) (← links)
• Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
• New algorithms for a simple measure of network partitioning (Q2700788) (← links)
• Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
• A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
• Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← 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)
• New algorithms for a simple measure of network partitioning (Q6111946) (← links)