Structural complexity of multiobjective NP search problems

DOI10.1007/978-3-642-29344-3_29MaRDI QIDQ2894478zbMATH OpenOpenAlexFDO

Authors Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29344-3_29

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The multiobjective shortest path problem is NP-hard, or is it?
• scientific article; zbMATH DE number 4070651
• The relative complexity of NP search problems
• scientific article; zbMATH DE number 1332676
• scientific article; zbMATH DE number 1263206

Cited in

(2)

• A view of P systems from information theory
• scientific article; zbMATH DE number 5887313 (Why is no real title available?)

This page was built for publication: Structural complexity of multiobjective NP search problems

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