Pages that link to "Item:Q557903"
From MaRDI portal
The following pages link to Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903):
Displaying 5 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
