- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Algorithmica (82:12) - London [u.a.] : SpringerNature - S. 3521-3565
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Technische Universität Berlin
- (when)
-
2021
- Creator
-
Mertzios, George B.
Nichterlein, André
Niedermeier, Rolf
- DOI
-
10.14279/depositonce-11630
- Handle
-
11303/12830
- URN
-
urn:nbn:de:101:1-2021031701045869971103
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:47 PM CET
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
- Mertzios, George B.
- Nichterlein, André
- Niedermeier, Rolf
- Technische Universität Berlin
Time of origin
- 2021
Other Objects (12)
Greedy algorithms for max sat and maximum matching : their power and limitations
Evolutionary Algorithms and the Maximum Matching Problem
Time domain model reduction by moment matching
Time domain model reduction by moment matching
Benchmarking quantum annealing with maximum cardinality matching problems
Moment matching based model order reduction in computational electromagnetism
Moment matching based model order reduction in computational electromagnetism
Matching Heterogeneous Agents with a Linear Search Technology
Optimal vs. Classical Linear Dimension Reduction
Optimal vs. classical linear dimension reduction
On the complexity of linear and stratified context matching problems
Stress reduction of electronic power switching elements
Greedy algorithms for max sat and maximum matching : their power and limitations
Evolutionary Algorithms and the Maximum Matching Problem
Time domain model reduction by moment matching
Time domain model reduction by moment matching
Benchmarking quantum annealing with maximum cardinality matching problems
Moment matching based model order reduction in computational electromagnetism
Moment matching based model order reduction in computational electromagnetism
Matching Heterogeneous Agents with a Linear Search Technology
Optimal vs. Classical Linear Dimension Reduction
Optimal vs. classical linear dimension reduction
On the complexity of linear and stratified context matching problems
Stress reduction of electronic power switching elements
Greedy algorithms for max sat and maximum matching : their power and limitations
Evolutionary Algorithms and the Maximum Matching Problem
Time domain model reduction by moment matching
Time domain model reduction by moment matching
Benchmarking quantum annealing with maximum cardinality matching problems
Moment matching based model order reduction in computational electromagnetism
Moment matching based model order reduction in computational electromagnetism
Matching Heterogeneous Agents with a Linear Search Technology
Optimal vs. Classical Linear Dimension Reduction
Optimal vs. classical linear dimension reduction
On the complexity of linear and stratified context matching problems