📚
📚
The Cartographer
Approximation of the Quadratic Knapsack Problem
September 06, 2015 · Declared Dead · 🏛 Operations Research Letters
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Richard Taylor
arXiv ID
1509.01866
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC,
cs.DM,
math.CO
Citations
17
Venue
Operations Research Letters
Last Checked
3 months ago
Abstract
For any given $ε>0$ we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within $O(n^{2/5+ε})$ and a run time within $O(n^{9/ε})$.
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
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
📚
📚
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted