Pages that link to "Item:Q1891922"
From MaRDI portal
The following pages link to Approximation techniques for hypergraph partitioning problems (Q1891922):
Displaying 8 items.
- Finding a minimal spanning hypertree of a weighted hypergraph (Q2168776) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- Solution of one problem of optimal partition of the vertex set of a hypergraph (Q3752416) (← links)
- (Q3807893) (← links)
- Finding part-machine families using graph partitioning techniques (Q4230183) (← links)
- (Q4471317) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Partitioning problems in dense hypergraphs (Q5957354) (← links)