- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Faster exact solution of sparse MaxCut and QUBO problems ; volume:15 ; number:3 ; day:15 ; month:4 ; year:2023 ; pages:445-470 ; date:9.2023
Mathematical programming computation ; 15, Heft 3 (15.4.2023), 445-470, 9.2023
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s12532-023-00236-6
- URN
-
urn:nbn:de:101:1-2023102617085846214254
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 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
- Rehfeldt, Daniel Markus
- Koch, Thorsten
- Shinano, Yuji
- SpringerLink (Online service)
Other Objects (12)
Faster Algorithms for Sparse Fourier Transform
Faster Cut Sparsification of Weighted Graphs
Even Faster Exact k-Means Clustering
Faster randomized block sparse Kaczmarz by averaging
Faster algorithms for counting subgraphs in sparse graphs
Partial Lasserre relaxation for sparse Max-Cut
Exact recovery of sparse signals with side information
Sparse compression of expected solution operators
Exact sparse representation recovery in signal demixing and group BLASSO
Efficient solution of large sparse linear systems
Peak calling by Sparse Enrichment Analysis for CUT&RUN chromatin profiling
Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients
Faster Algorithms for Sparse Fourier Transform
Faster Cut Sparsification of Weighted Graphs
Even Faster Exact k-Means Clustering
Faster randomized block sparse Kaczmarz by averaging
Faster algorithms for counting subgraphs in sparse graphs
Partial Lasserre relaxation for sparse Max-Cut
Exact recovery of sparse signals with side information
Sparse compression of expected solution operators
Exact sparse representation recovery in signal demixing and group BLASSO
Efficient solution of large sparse linear systems
Peak calling by Sparse Enrichment Analysis for CUT&RUN chromatin profiling
Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients
Faster Algorithms for Sparse Fourier Transform
Faster Cut Sparsification of Weighted Graphs
Even Faster Exact k-Means Clustering
Faster randomized block sparse Kaczmarz by averaging
Faster algorithms for counting subgraphs in sparse graphs
Partial Lasserre relaxation for sparse Max-Cut
Exact recovery of sparse signals with side information
Sparse compression of expected solution operators
Exact sparse representation recovery in signal demixing and group BLASSO
Efficient solution of large sparse linear systems
Peak calling by Sparse Enrichment Analysis for CUT&RUN chromatin profiling