Pages that link to "Item:Q1388145"
From MaRDI portal
The following pages link to Lectures on proof verification and approximation algorithms (Q1388145):
Displayed 5 items.
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- On the approximation of the minimum disturbance \(p\)-facility location problem (Q1348254) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)