Pages that link to "Item:Q2867077"
From MaRDI portal
The following pages link to Fixed-Parameter and Approximation Algorithms: A New Look (Q2867077):
Displaying 15 items.
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Parameterized (in)approximability of subset problems (Q1785218) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Faster exact algorithms for hard problems: A parameterized point of view (Q5931443) (← links)
