The complexity of computing minimal unidirectional covering sets

DOI10.1007/S00224-012-9437-9MaRDI QIDQ6826413zbMATH OpenFDO

Authors Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann, Jörg Rothe

Publication date 21 October 2013

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-012-9437-9

zbMATH Keywords

computational complexitycomputational social choiceminimal downward covering setsminimal upward covering sets

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)

This page was built for publication: The complexity of computing minimal unidirectional covering sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826413)