Pages that link to "Item:Q2503307"
From MaRDI portal
The following pages link to Completeness in approximation classes beyond APX (Q2503307):
Displaying 9 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Genetic local search and hardness of approximation for the server load balancing problem (Q2399467) (← links)
- Completeness in approximation classes (Q3974859) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)
- Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)