Pages that link to "Item:Q3183459"
From MaRDI portal
The following pages link to On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (Q3183459):
Displayed 4 items.
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (Q3183459) (← links)