- Sprache
-
Englisch
- Anmerkungen
-
Würzburg, Univ., Diss., 2010
- Identifier
-
1008952036
Thema
Standortplanung ; NP-hartes Problem ; Approximationsalgorithmus ; Graph ; Effizienter Algorithmus; Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:52 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Stable matchings beyond stable marriage: models, algorithms, complexity
Effiziente Algorithmen für baumstrukturierte Graphklassen
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Efficient parameterized algorithms on structured graphs
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Network-Design Problems in Graphs and on the Plane
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Polynomially solvable cases of hypergraph transversal and related problems
Network-design problems in graphs and on the plane
Fixed-parameter algorithms for the consensus analysis of genomic data
Stable matchings beyond stable marriage: models, algorithms, complexity
Effiziente Algorithmen für baumstrukturierte Graphklassen
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Efficient parameterized algorithms on structured graphs
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Network-Design Problems in Graphs and on the Plane
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Polynomially solvable cases of hypergraph transversal and related problems
Network-design problems in graphs and on the plane
Fixed-parameter algorithms for the consensus analysis of genomic data
Stable matchings beyond stable marriage: models, algorithms, complexity
Effiziente Algorithmen für baumstrukturierte Graphklassen
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Efficient parameterized algorithms on structured graphs
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Network-Design Problems in Graphs and on the Plane
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Polynomially solvable cases of hypergraph transversal and related problems
Network-design problems in graphs and on the plane