- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts ; day:25 ; month:10 ; year:2017 ; pages:1-42
Algorithmica ; (25.10.2017), 1-42
- Urheber
-
Etscheid, Michael
- Beteiligte Personen und Organisationen
- DOI
-
10.1007/s00453-017-0388-z
- URN
-
urn:nbn:de:1111-201712195232
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:28 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Etscheid, Michael
- Mnich, Matthias
- SpringerLink (Online service)
Ähnliche Objekte (12)
Linear kernels and linear-time algorithms for finding large cuts
Linear kernels and linear-time algorithms for finding large cuts
Linear cuts in Boolean networks
Local linear smoothers using asymmetric kernels
Local Linear Smoothers Using Asymmetric Kernels
k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs
Linear Kernels for Outbranching Problems in Sparse Digraphs
A Decentralized Linear Process for Finding Equilibria
Finding Matching Cuts in H-Free Graphs
Learning linear classifiers : theory and algorithms
Nondeterministic versus probabilistic linear search algorithms
Well-posedness of linear integro-differential equations with operaor-valued kernels
Linear kernels and linear-time algorithms for finding large cuts
Linear kernels and linear-time algorithms for finding large cuts
Linear cuts in Boolean networks
Local linear smoothers using asymmetric kernels
Local Linear Smoothers Using Asymmetric Kernels
k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs
Linear Kernels for Outbranching Problems in Sparse Digraphs
A Decentralized Linear Process for Finding Equilibria
Finding Matching Cuts in H-Free Graphs
Learning linear classifiers : theory and algorithms
Nondeterministic versus probabilistic linear search algorithms
Well-posedness of linear integro-differential equations with operaor-valued kernels
Linear kernels and linear-time algorithms for finding large cuts
Linear kernels and linear-time algorithms for finding large cuts
Linear cuts in Boolean networks
Local linear smoothers using asymmetric kernels
Local Linear Smoothers Using Asymmetric Kernels
k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs
Linear Kernels for Outbranching Problems in Sparse Digraphs
A Decentralized Linear Process for Finding Equilibria
Finding Matching Cuts in H-Free Graphs
Learning linear classifiers : theory and algorithms
Nondeterministic versus probabilistic linear search algorithms