Pages that link to "Item:Q2343081"
From MaRDI portal
The following pages link to On subexponential and FPT-time inapproximability (Q2343081):
Displaying 15 items.
- Sparsification and subexponential approximation (Q1702300) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- (Q2867072) (redirect page) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- (Q3304124) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5115779) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
