Pages that link to "Fully polynomial-time approximation scheme"

The following pages link to Fully polynomial-time approximation scheme:

Showing 13 items.

• Bin covering problem ‎ (links)
• Egalitarian item allocation ‎ (links)
• Fully polynomial-time approximation scheme (transclusion) ‎ (links)
• FPTAS (redirect page) ‎ (links)
  • Donor coordination ‎ (links)
  • Knapsack problem ‎ (links)
  • Combinatorial participatory budgeting ‎ (links)
  • Envy minimization ‎ (links)
  • Bin packing problem ‎ (links)
• Fully polynomial time approximation scheme (redirect page) ‎ (links)
  • Knapsack problem ‎ (links)
• Welfare maximization ‎ (links)
• Fptas (redirect page) ‎ (links)
• Fully polynomial approximation scheme (redirect page) ‎ (links)
  • Minimum-weight triangulation ‎ (links)
• Multiple subset sum ‎ (links)
• English Wikipedia @ Freddythechick:WikiProject Academic Journals/Journals cited by Wikipedia/DOI/10.1125 ‎ (links)
• English Wikipedia @ Freddythechick:CHECKWIKI/WPC 565 dump ‎ (links)
• English Wikipedia @ Freddythechick:WikiProject Academic Journals/Journals cited by Wikipedia/J30 ‎ (links)
• English Wikipedia @ Freddythechick:WikiProject Academic Journals/Journals cited by Wikipedia/Publisher7 ‎ (links)