- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
An Improved Approximation Algorithm for Knapsack Median Using Sparsification ; volume:80 ; number:4 ; day:29 ; month:1 ; year:2018 ; pages:1093-1114 ; date:4.2018
Algorithmica ; 80, Heft 4 (29.1.2018), 1093-1114, 4.2018
- Classification
-
Mathematik
- Creator
-
Byrka, Jarosław
- Contributor
-
Pensyl, Thomas
Rybicki, Bartosz
Spoerhase, Joachim
Srinivasan, Aravind
Trinh, Khoa
SpringerLink (Online service)
- DOI
-
10.1007/s00453-017-0294-4
- URN
-
urn:nbn:de:1111-201804246376
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Byrka, Jarosław
- Pensyl, Thomas
- Rybicki, Bartosz
- Spoerhase, Joachim
- Srinivasan, Aravind
- Trinh, Khoa
- SpringerLink (Online service)
Other Objects (12)
Approximation Algorithms for 3D Orthogonal Knapsack
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Parameterized approximation scheme for the multiple knapsack problem
Approximation of knapsack problems with conflict and forcing graphs
A fast approximation scheme for the multiple knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
New binary bat algorithm for solving 0–1 knapsack problem
"A.Y.H. Knapsack"
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Approximation Algorithms for 3D Orthogonal Knapsack
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Parameterized approximation scheme for the multiple knapsack problem
Approximation of knapsack problems with conflict and forcing graphs
A fast approximation scheme for the multiple knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
New binary bat algorithm for solving 0–1 knapsack problem
"A.Y.H. Knapsack"
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Approximation Algorithms for 3D Orthogonal Knapsack
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Parameterized approximation scheme for the multiple knapsack problem
Approximation of knapsack problems with conflict and forcing graphs
A fast approximation scheme for the multiple knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
New binary bat algorithm for solving 0–1 knapsack problem
"A.Y.H. Knapsack"
A polynomial linear search algorithm for the N-dimensional Knapsack problem