An Improved Approximation Algorithm for Knapsack Median Using Sparsification

Algorithmica - United States
doi 10.1007/s00453-017-0294-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Improved Local Computation Algorithm for Set Cover via Sparsification

2020English

An Improved Dynamic Time Warping Algorithm Employing Nonlinear Median Filtering

2011English

An Algorithm for the Quadratic Approximation

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
1984English

Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm

International Journal of Applied Evolutionary Computation
2014English

Improved Median Filter Using ROAD for Removal of Impulse Noise

International Journal of Computer Applications
2014English

An Iterated Semi-Greedy Algorithm for the 0-1 Quadratic Knapsack Problem

EasyChair Preprints
2018English

An Improved Toeplitz Approximation Method

1988English

Dimensionality Reduction Using an Improved Whale Optimization Algorithm for Data Classification

International Journal of Modern Education and Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy