Hochschulschrift
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
- Weitere Titel
-
Festparameter-Linearzeitalgorithmen für NP-schwere Graphen- und Hypergraphenprobleme aus industriellen Anwendungen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Foundations of Computing ; 01
- Schlagwort
-
NP-hartes Problem
Graph
Hypergraph
Berechnungskomplexität
Effizienter Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Universitätsverlag der TU Berlin
- (wann)
-
2014
- Urheber
- Beteiligte Personen und Organisationen
-
Niedermeier, Rolf
Fomin, Fedor V.
Möhring, Rolf
- URN
-
urn:nbn:de:kobv:83-opus4-55292
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 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.
Objekttyp
- Hochschulschrift
Beteiligte
- Van Bevern, René
- Niedermeier, Rolf
- Fomin, Fedor V.
- Möhring, Rolf
- Universitätsverlag der TU Berlin
Entstanden
- 2014
Ähnliche Objekte (12)
Preprocessing to Deal with Hard Problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
Modification-fair cluster editing
A refined complexity analysis of fair districting over graphs
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs
Preprocessing to Deal with Hard Problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
Modification-fair cluster editing
A refined complexity analysis of fair districting over graphs
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs
Preprocessing to Deal with Hard Problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
Modification-fair cluster editing
A refined complexity analysis of fair districting over graphs
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
On coalitional manipulation for multiwinner elections: shortlisting