Pages that link to "Item:Q3990575"
From MaRDI portal
The following pages link to One-Half Approximation Algorithms for the k-Partition Problem (Q3990575):
Displayed 9 items.
- On approximating the memory-constrained module allocation problem (Q286996) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- NP-hardness of \(m\)-dimensional weighted matching problems (Q2166755) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)