- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1436-4646
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Complexity of packing common bases in matroids ; day:8 ; month:4 ; year:2020 ; pages:1-18
Mathematical programming ; (8.4.2020), 1-18
- Creator
-
Bérczi, Kristóf
Schwarcz, Tamás
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10107-020-01497-y
- URN
-
urn:nbn:de:101:1-2020062423245841101151
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 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
- Bérczi, Kristóf
- Schwarcz, Tamás
- SpringerLink (Online service)
Other Objects (12)
The Complexity of Packing Edge-Disjoint Paths
On the complexity of anchored rectangle packing
On the Parameterized Complexity of Compact Set Packing
Scheduling and Packing Problems : Algorithms and Complexity
Parameterized Complexity of $$(A,\ell )$$ ( A , ℓ ) -Path Packing
On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack
Container packing
Packing the Mule
Chapter XIX. Packing
European Packing Federation
Algorithmic Symplectic Packing
Packing returning secretaries
The Complexity of Packing Edge-Disjoint Paths
On the complexity of anchored rectangle packing
On the Parameterized Complexity of Compact Set Packing
Scheduling and Packing Problems : Algorithms and Complexity
Parameterized Complexity of $$(A,\ell )$$ ( A , ℓ ) -Path Packing
On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack
Container packing
Packing the Mule
Chapter XIX. Packing
European Packing Federation
Algorithmic Symplectic Packing
Packing returning secretaries
The Complexity of Packing Edge-Disjoint Paths
On the complexity of anchored rectangle packing
On the Parameterized Complexity of Compact Set Packing
Scheduling and Packing Problems : Algorithms and Complexity
Parameterized Complexity of $$(A,\ell )$$ ( A , ℓ ) -Path Packing
On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack
Container packing
Packing the Mule
Chapter XIX. Packing
European Packing Federation
Algorithmic Symplectic Packing