Pages that link to "Item:Q676274"
From MaRDI portal
The following pages link to Improved parallel approximation of a class of integer programming problems (Q676274):
Displaying 9 items.
- Extending NC and RNC algorithms (Q1263974) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- Computational experience with a software framework for parallel integer programming (Q2901073) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- (Q4029789) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)