Monografie
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
- Sprache
-
Englisch
- Umfang
-
XIX, 205 S.
- Anmerkungen
-
Zugl.: Berlin, Techn. Univ., Diss., 2014
- ISBN
-
978-3-7983-2705-4
- Identifier
-
1058974750
- Reihe
-
Foundations of computing; Vol. 1
Thema
NP-hartes Problem ; Graph ; Hypergraph ; Berechnungskomplexität ; Effizienter Algorithmus ; Hochschulschrift
Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.04.2024, 08:42 MESZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-parameter algorithms for the consensus analysis of genomic data
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Efficient algorithms for production scheduling
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Effiziente Algorithmen für baumstrukturierte Graphklassen
Multivariate algorithmics in biological data analysis
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
Fine-grained complexity analysis of some combinatorial data science problems
Efficient parameterized algorithms on structured graphs
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-parameter algorithms for the consensus analysis of genomic data
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Efficient algorithms for production scheduling
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Effiziente Algorithmen für baumstrukturierte Graphklassen
Multivariate algorithmics in biological data analysis
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
Fine-grained complexity analysis of some combinatorial data science problems
Efficient parameterized algorithms on structured graphs
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-parameter algorithms for the consensus analysis of genomic data
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Efficient algorithms for production scheduling
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Effiziente Algorithmen für baumstrukturierte Graphklassen
Multivariate algorithmics in biological data analysis
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
Fine-grained complexity analysis of some combinatorial data science problems