Pages that link to "Item:Q2197546"
From MaRDI portal
The following pages link to Approximation algorithms for the partial assignment problem (Q2197546):
Displaying 11 items.
- Some properties of the alternating separation (AS) and ASAP algorithm (Q866091) (← links)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- Randomized approximation and online algorithms for assignment problems (Q2789264) (← links)
- Tight approximation algorithms for maximum separable assignment problems (Q2884281) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- Approximation algorithms for array partitioning problems (Q4651813) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)