- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2886
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Approximation of knapsack problems with conflict and forcing graphs ; day:6 ; month:6 ; year:2016 ; pages:1-24
Journal of combinatorial optimization ; (6.6.2016), 1-24
- Creator
-
Pferschy, Ulrich
- Contributor
-
Schauer, Joachim
SpringerLink (Online service)
- DOI
-
10.1007/s10878-016-0035-7
- URN
-
urn:nbn:de:1111-201606077549
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 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
- Pferschy, Ulrich
- Schauer, Joachim
- 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
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
A fast approximation scheme for the multiple knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
"A.Y.H. Knapsack"
Knapsack, St. Josef
Approximation algorithms for intersection graphs
Verfahren zur Herstellung von Vinylchlorid.- Anmelder: Knapsack AG, Knapsack/Köln, BRD
Robust principal graphs for data approximation
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
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
A fast approximation scheme for the multiple knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
"A.Y.H. Knapsack"
Knapsack, St. Josef
Approximation algorithms for intersection graphs
Verfahren zur Herstellung von Vinylchlorid.- Anmelder: Knapsack AG, Knapsack/Köln, BRD
Robust principal graphs for data approximation
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
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
A fast approximation scheme for the multiple knapsack problem
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
"A.Y.H. Knapsack"
Knapsack, St. Josef
Approximation algorithms for intersection graphs
Verfahren zur Herstellung von Vinylchlorid.- Anmelder: Knapsack AG, Knapsack/Köln, BRD