R.I.P.
👻
Ghosted
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
June 08, 2020 · Declared Dead · 🏛 Electron. Colloquium Comput. Complex.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
arXiv ID
2006.04411
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC
Citations
71
Venue
Electron. Colloquium Comput. Complex.
Last Checked
2 months ago
Abstract
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Data Structures & Algorithms
R.I.P.
👻
Ghosted
Relief-Based Feature Selection: Introduction and Review
R.I.P.
👻
Ghosted
Route Planning in Transportation Networks
R.I.P.
👻
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
👻
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
👻
Ghosted
Graph Isomorphism in Quasipolynomial Time
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted