Pages that link to "Item:Q813332"
From MaRDI portal
The following pages link to Improved approximation algorithms for maximum graph partitioning problems (Q813332):
Displaying 20 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- An improved rounding method and semidefinite programming relaxation for graph partition (Q1849503) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Numerical study of semidefinite bounds for the \(k\)-cluster problem (Q2883586) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning (Q3453578) (← links)
- Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465866) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)
