Pages that link to "Item:Q5115701"
From MaRDI portal
The following pages link to From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701):
Displaying 18 items.
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits (Q2327096) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5090466) (← links)
- (Q5091192) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- (Q5875468) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- Complexity of minimum-size arc-inconsistency explanations (Q6154178) (← links)
- Exact and heuristic algorithms for the domination problem (Q6555173) (← links)
