Pages that link to "Item:Q1678175"
From MaRDI portal
The following pages link to Time-approximation trade-offs for inapproximable problems (Q1678175):
Displayed 9 items.
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)