- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
On the Parameterized Intractability of Determinant Maximization ; day:3 ; month:2 ; year:2024 ; pages:1-33
Algorithmica ; (3.2.2024), 1-33
- Creator
-
Ohsaka, Naoto
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01205-0
- URN
-
urn:nbn:de:101:1-2024041316073691426658
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 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
- Ohsaka, Naoto
- SpringerLink (Online service)
Other Objects (12)
Parameterized maximization
Who should have a place on the ark? : Parameterized algorithms for the maximization of the phylogenetic
On parameterized counting
On parameterized enumeration
On the multinomial determinant.
Parameterized complexity
Parameterized approximability
Parameterized randomization
Assignment maximization
On the Parameterized Complexity of Compact Set Packing
Efficient parameterized algorithms on structured graphs
On the Parameterized Complexity of the Expected Coverage Problem
Parameterized maximization
Who should have a place on the ark? : Parameterized algorithms for the maximization of the phylogenetic
On parameterized counting
On parameterized enumeration
On the multinomial determinant.
Parameterized complexity
Parameterized approximability
Parameterized randomization
Assignment maximization
On the Parameterized Complexity of Compact Set Packing
Efficient parameterized algorithms on structured graphs
On the Parameterized Complexity of the Expected Coverage Problem
Parameterized maximization
Who should have a place on the ark? : Parameterized algorithms for the maximization of the phylogenetic
On parameterized counting
On parameterized enumeration
On the multinomial determinant.
Parameterized complexity
Parameterized approximability
Parameterized randomization
Assignment maximization
On the Parameterized Complexity of Compact Set Packing
Efficient parameterized algorithms on structured graphs