Pages that link to "Item:Q3000079"
From MaRDI portal
The following pages link to Solving a permutation problem by a fully polynomial-time approximation scheme (Q3000079):
Displaying 4 items.
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055) (← links)
- (Q4036996) (← links)
- Partial dominated schedules and minimizing the total completion time of deteriorating jobs (Q5746677) (← links)