Pages that link to "Item:Q1069445"
From MaRDI portal
The following pages link to Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445):
Displaying 10 items.
- Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum (Q5144983) (← links)
- LATIN 2004: Theoretical Informatics (Q5901640) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)