Pages that link to "Item:Q5465866"
From MaRDI portal
The following pages link to FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465866):
Displaying 9 items.
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← 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)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
- (Q4886052) (← links)
