Pages that link to "Fully polynomial-time approximation scheme"
From HandWiki
The following pages link to Fully polynomial-time approximation scheme:
Displayed 9 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Strong NP-completeness (← links)
- Polynomial-time approximation scheme (← links)
- Partition problem (← links)
- Bin covering problem (← links)
- Egalitarian item allocation (← links)
- Multiple subset sum (← links)
- Fully polynomial-time approximation scheme (transclusion) (← links)
- Welfare maximization (← links)
- Finance:Leontief utilities (← links)