Pages that link to "Item:Q3883530"
From MaRDI portal
The following pages link to An algorithm to solve them ×n assignment problem in expected timeO(mn logn) (Q3883530):
Displayed 8 items.
- Selected topics on assignment problems (Q697571) (← links)
- Random assignment problems (Q953417) (← links)
- Average case optimality (Q1071513) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Average complexity of divide-and-conquer algorithms (Q1114395) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
- Recent developments in information-based complexity (Q3780359) (← links)