An Improved Approximation Algorithm for Knapsack Median Using Sparsification

Algorithmica- United States

doi 10.1007/s00453-017-0294-4

Full Text

Abstract

Available in

Categories

Applied Mathematics

Computer Science Applications

Computer Science

Date

January 29, 2018

Authors

Jarosław Byrka

Bartosz Rybicki

Joachim Spoerhase

Aravind Srinivasan

Publisher

Springer Science and Business Media LLC

Related search

Improved Approximation Results for Stochastic Knapsack Problems

English

Improved Local Computation Algorithm for Set Cover via Sparsification

English

An Improved Dynamic Time Warping Algorithm Employing Nonlinear Median Filtering

English

An Algorithm for the Quadratic Approximation

Journal of Computational and Applied Mathematics

Computational Mathematics

Applied Mathematics

English

Improved Median Filter Using ROAD for Removal of Impulse Noise

International Journal of Computer Applications

English

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

EasyChair Preprints

English

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

International Journal of Applied Evolutionary Computation

English

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

International Journal of Operations Research and Information Systems

English

An Improved Toeplitz Approximation Method

English