The following pages link to (Q4252365):
Displaying 13 items.
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Approximation algorithms for extensible bin packing (Q880529) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- On-line scheduling with extendable working time on a small number of machines (Q1007518) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
