Pages that link to "Item:Q313963"
From MaRDI portal
The following pages link to Parameterized approximation algorithms for packing problems (Q313963):
Displaying 13 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Pseudo-polynomial time algorithms for combinatorial food mixture packing problems (Q898726) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- Real time asymptotic packing (Q1378545) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Algorithms for packing problems (Q2926631) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- (Q2987386) (← links)
- (Q4607900) (← links)
- Approximation Algorithms for Demand Strip Packing (Q6090894) (← links)
