Pages that link to "Fully polynomial-time approximation scheme"
Showing 23 items.
- Polynomial-time approximation scheme (links | edit)
- FPTAS (redirect page) (links | edit)
- Bin packing problem (links | edit)
- Combinatorial optimization (links | edit)
- Approximation error (links | edit)
- Uniform-machines scheduling (links | edit)
- Strong NP-completeness (links | edit)
- Utilitarian cake-cutting (links | edit)
- Combinatorial participatory budgeting (links | edit)
- Envy minimization (links | edit)
- Unrelated-machines scheduling (links | edit)
- Knapsack auction (links | edit)
- Donor coordination (links | edit)
- Arrow–Debreu exchange market (links | edit)
- Talk:Game theory/Archive 1 (links | edit)
- Talk:Cobham's thesis (links | edit)
- Fully polynomial time approximation scheme (redirect page) (links | edit)
- Strong NP-completeness (links | edit)
- Fptas (redirect page) (links | edit)
- Leontief utilities (links | edit)
- Fully polynomial approximation scheme (redirect page) (links | edit)
- Bin covering problem (links | edit)
- Egalitarian item allocation (links | edit)
- Multiple subset sum (links | edit)
- Fully-polynomial time approximation scheme (redirect page) (links | edit)
- Welfare maximization (links | edit)
- Talk:Fully polynomial-time approximation scheme (transclusion) (links | edit)
- User:Mathbot/Changes to mathlists (links | edit)
- User:Erel Segal (links | edit)
- User:Akaibu/Low Link Density Review (links | edit)
- Wikipedia:WikiProject Mathematics/List of mathematics articles (D–F) (links | edit)
- Wikipedia:WikiProject Mathematics/List of mathematics articles (F) (links | edit)
- Wikipedia:WikiProject Academic Journals/Journals cited by Wikipedia/J30 (links | edit)
- Wikipedia:WikiProject Check Wikipedia/WPC all (links | edit)
- Wikipedia:WikiProject Academic Journals/Journals cited by Wikipedia/Publisher8 (links | edit)
- Wikipedia:WikiProject Academic Journals/Journals cited by Wikipedia/DOI/10.1125 (links | edit)
- Wikipedia:CHECKWIKI/WPC 565 dump (links | edit)