Hochschulschrift
Exploiting structure in computationally hard voting problems
- Weitere Titel
-
Ausnutzung von Strukturen in berechnungsschweren Wahlproblemen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Dissertation, 2015
- Erschienen in
-
Foundations of computing ; 6
- Schlagwort
-
Entscheidungsproblem
Wahlverfahren
Wahlverhalten
Präferenz
Kollektiventscheidung
Berechenbarkeit
Parametrisierte Komplexität
NP-hartes Problem
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Universitätsverlag der TU Berlin
- (wann)
-
2016
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.14279/depositonce-5113
- Handle
-
11303/5438
- URN
-
urn:nbn:de:101:1-201804183383
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:03 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
- Chen, Jiehua
- Niedermeier, Rolf
- Lang, Jérôme
- Elkind, Edith
- Technische Universität Berlin. Universitätsbibliothek
- Universitätsverlag der TU Berlin
Entstanden
- 2016
Ähnliche Objekte (12)
Exploiting structure in computationally hard voting problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Preprocessing to Deal with Hard Problems
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
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
Exploiting structure in computationally hard voting problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Preprocessing to Deal with Hard Problems
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
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
Exploiting structure in computationally hard voting problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Preprocessing to Deal with Hard Problems
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
Modification-fair cluster editing