zweidimensionales bewegtes Bild
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
- Standort
-
Hannover TIB
- Umfang
-
30MB, 00:20:43:04 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Pacut, Maciej
Bienkowski, Marcin
Piecuch, Krzysztof
- DOI
-
10.5446/49336
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Pacut, Maciej
- Bienkowski, Marcin
- Piecuch, Krzysztof
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
On the two-dimensional knapsack problem for convex polygons: Q/A Session C - Paper C3.C
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
Pricing the multiple-choice nested knapsack problem
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization: Q/A Session A - Paper A2.F
Panel Session Day Two: Q&A
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion: Q/A Session F - Paper F2.F
Parameterized approximation scheme for the multiple knapsack problem
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
On the two-dimensional knapsack problem for convex polygons: Q/A Session C - Paper C3.C
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
Pricing the multiple-choice nested knapsack problem
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization: Q/A Session A - Paper A2.F
Panel Session Day Two: Q&A
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion: Q/A Session F - Paper F2.F
Parameterized approximation scheme for the multiple knapsack problem
Qa- [Qa-]
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
On the two-dimensional knapsack problem for convex polygons: Q/A Session C - Paper C3.C
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
Pricing the multiple-choice nested knapsack problem
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization: Q/A Session A - Paper A2.F
Panel Session Day Two: Q&A
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion: Q/A Session F - Paper F2.F
Parameterized approximation scheme for the multiple knapsack problem
Qa- [Qa-]